荞麦假面

分类

/ 注册

全部文章（共46篇）

题解 | 邮票

#include <iostream> #include <vector> using namespace std; int main() { vector<bool> a(189, false); //最多有188角邮资 for (in...

2025-03-09

0 16

题解 | 反序相等

#include <iostream> using namespace std; int reverse(int n) { int t = n; int count = 0; while (t) { count++; t /= 1...

2025-03-09

0 17

题解 | 日期差值

#include <iostream> using namespace std; int main() { int y, m, d; int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}...

2025-03-08

0 14

题解 | 最简真分数

#include <iostream> #include <vector> using namespace std; bool isEasiest(int a, int b) { int smaller = a < b ? a : b; for (in...

2025-03-07

1 14

题解 | 买房子

#include <iostream> using namespace std; int main() { int n; double k; int amount; double price; int count; while (cin ...

2025-03-07

0 18

题解 | 数字反转

#include <iostream> using namespace std; int reverse(int n) { int t = n; int count = 0; while (t) { count++; t /= 1...

2025-03-07

1 18

题解 | 整数奇偶排序

#include <iostream> using namespace std; int cmp(const void* a, const void* b) { return *(int*)a - *(int*)b; } void reverse(int a[]) { f...

2025-03-06

0 24

题解 | 谁是你的潜在朋友

#include <iostream> #include <vector> using namespace std; int main() { int n, m; cin >> n >> m; vector<int>...

2025-03-06

0 19

题解 | 剩下的树

#include <iostream> #include <vector> using namespace std; int main() { int L, M; cin >> L >> M; vector<bool&g...

2025-03-06

0 27

题解 | 鸡兔同笼

#include <iostream> using namespace std; int main() { int n; int max, min; while (cin >> n) { if (n % 2) { ...

2025-03-03

0 33