朝外信奥 1 队 2026-06-07 CSP-S 2024 初赛模拟卷 5

01 #include <iostream>
02 #include <algorithm>
03 #include <string.h>
04 using namespace std;
05 const int N = 100000, M = 100000;
06 const long long mod = 1e8 - 3;
07 struct StMatch { int a, b; } matches[N + 1];
08 bool operator < (const StMatch a, const StMatch b) { return a.a < b.a; }
09 struct StTreeArray {
10     int tree[M + 1];
11     int lb(int x) { return x & (-x); }
12     void add(int x, int t) {
13         while (x <= M) {
14             tree[x] += t;
15             x += lb(x);
16         }
17     }
18     int sum(int x) {
19         int ans = 0;
20         while (x > 0) {
21             ans += tree[x];
22             x -= lb(x);
23         }
24         return ans;
25     }
26 } t;
27 int n, a[N + 2], b[N + 2], pos[N + 2];
28 int index(int a[], int x) {
29     int l = 1, r = n;
30     while (l < r) {
31         int m = (l + r) >> 1;
32         if (a[m] == x) return m;
33         if (a[m] < x) l = m + 1;
34         else r = m - 1;
35     }
36     if (a[l] == x) return l;
37     if (a[r] == x) return r;
38     return 0;
39 }
40 int main() {
41     cin >> n;
42     ...
43 }

01 #include <cstdio>
02 using namespace std;
03 int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
04 int main() {
05     int T;
06     scanf("%d", &T);
07     while (T--) {
08         int a0, a1, b0, b1;
09         scanf("%d%d%d%d", &a0, &a1, &b0, &b1);
10         int p = a0 / a1, q = b1 / b0, ans = 0;
11         for (int x = 1; x * x <= b1; x++) {
12             if (b1 % x == 0) {
13                 if (x % a1 == 0 && gcd(x / a1, p) == 1 && gcd(q, b1 / x) == 1) ans++;
14                 int y = b1 / x;
15                 if (x == y) continue;
16                 if (y % a1 == 0 && gcd(y / a1, p) == 1 && gcd(q, b1 / y) == 1) ans++;
17             }
18         }
19         printf("%d\n", ans);
20     }
21     return 0;
22 }

01 #include <bits/stdc++.h>
02 #define int long long
03 using namespace std;
04 signed main() {
05     int a, b;
06     scanf("%lld%lld", &a, &b);
07     int cnt = 0;
08     while (a > b) {
09         cnt++;
10         if (a % 2 == 1) ①;
11         else a /= 2;
12     }
13     while (b >= a * 2) {
14         cnt++;
15         if (b % 2 == 1) ②;
16         else b /= 2;
17     }
18     if (③) { ... }
19     ...
20 }