Star's Blog

1
#include <iostream>
2

3
using namespace std;
4

5
int main() {
6
    int a, b;
7
    cin >> a >> b;
8
    cout << (a >= b ? "YES" : "NO") << endl;
9
    return 0;
10
}

1
#include <iostream>
2
#include <cmath>
3
#include <algorithm>
4

5
using namespace std;
6

7
bool prime(int x) {
8
    if (x <= 1) return false;
9
    int l = sqrt(x);
10
    for (int i = 2; i <= l; ++i) {
11
        if (x % i == 0) return false;
12
    }
13
    return true;
14
}
15

16
bool hui(int x) {
17
    string s = to_string(x);
18
    string t = s;
19
    reverse(t.begin(), t.end());
20
    return s == t;
21
}
22

23
int main() {
24
    int l, r;
25
    scanf("%d%d", &l, &r);
26
    for (int i = l; i <= r; ++i) {
27
        if (prime(i) && hui(i)) {
28
            printf("%d\n", i);
29
        }
30
    }
31
    return 0;
32
}

1
#include <iostream>
2
#include <sstream>
3

4
using namespace std;
5

6
int main() {
7
    ios::sync_with_stdio(0);
8
    cin.tie(0), cout.tie(0);
9
    int n, k, cur = 0;
10
    string s;
11
    cin >> n >> k;
12
    for (int i = 0; i < n; ++i) {
13
        cin >> s;
14
        if (cur + s.length() > k) {
15
            cout << endl << s;
16
            cur = s.length();
17
        }
18
        else {
19
            if (cur != 0) cout << ' ';
20
            cur += s.length();
21
            cout << s;
22
        }
23
    }
24
    cout << endl;
25
    return 0;
26
}

1
#include <iostream>
2
#include <cstring>
3

4
using namespace std;
5

6
const int N = 100010;
7

8
int f[N];
9

10
int main() {
11
    memset(f, 0x3f, sizeof(f));
12
    int n;
13
    scanf("%d", &n);
14
    f[0] = 0;
15
    for (int i = 1; i <= n; ++i) {
16
        for (int j = 1; (long long)j * j * j * j <= i; ++j) {
17
            f[i] = min(f[i], f[i - j * j * j * j] + 1);
18
        }
19
    }
20
    printf("%d\n", f[n]);
21
    return 0;
22
}

1
#include <iostream>
2

3
using namespace std;
4

5
int main() {
6
    ios::sync_with_stdio(0);
7
    cin.tie(0), cout.tie(0);
8
    int T;
9
    cin >> T;
10
    for (int t = 1; t <= T; ++t) {
11
        string s;
12
        cin >> s;
13
        int cur = 0, pre = 0, res = 0; // 当前干扰器个数，如果当前手上有 ≥ 2 个干扰器折返一次后的个数，任何一个时刻手上的最多干扰器个数
14
        bool f = false; // 判断前一个炮塔是否欠着干扰器
15
        for (int i = 0; i < s.length(); ++i) {
16
            if (s[i] == '*') {
17
                cur++, pre++;
18
                if (cur > 1) cur = pre;
19
                else if (cur && f) f = false, cur++;
20
            }
21
            else if (s[i] == '#') {
22
                if (i + 1 >= s.length() || s[i + 1] != '*') {
23
                    if (s[i - 1] != '#' && cur) cur--, f = true;
24
                    else break; // 必死
25
                }
26
                else f = false;
27
                if (s[i - 1] == '#') pre--, f = false;
28
            }
29
            else if (cur > 1) cur = pre;
30
            else if (cur && f) f = false, cur++;
31
            res = max(res, cur);
32
        }
33
        cout << res << endl;
34
    }
35
    return 0;
36
}