Star's Blog

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

4
using namespace std;
5

6
int main() {
7
    string s;
8
    int n;
9
    cin >> s >> n;
10
    n = n == 1 ? 0 : 7;
11
    if (s == "Monday") {
12
        cout << 6 + n << endl;
13
    }
14
    else if (s == "Tuesday") {
15
        cout << 5 + n << endl;
16
    }
17
    else if (s == "Wednesday") {
18
        cout << 4 + n << endl;
19
    }
20
    else if (s == "Thursday") {
21
        cout << 3 + n << endl;
22
    }
23
    else if (s == "Friday") {
24
        cout << 2 + n << endl;
25
    }
26
    else if (s == "Saturday") {
27
        cout << 1 + n << endl;
28
    }
29
    else if (s == "Sunday") {
30
        cout << 7 + n << endl;
31
    }
32
    return 0;
33
}

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

4
using namespace std;
5

6
int main() {
7
    int T;
8
    cin >> T;
9
    while (T--) {
10
        long long n, k, l, res = 0;
11
        cin >> n >> k;
12
        l = sqrt(n);
13
        for (int i = 1; i <= l; ++i) {
14
            if (n % i == 0) {
15
                if (i >= k) res = max(res, n / i);
16
                else if (n / i >= k) res = max(res, (long long)i);
17
            }
18
        }
19
        cout << res << endl;
20
    }
21
    return 0;
22
}

1
#include <iostream>
2

3
using namespace std;
4

5
const int N = 2010;
6

7
long long s[N][N];
8

9
int main() {
10
    int n;
11
    scanf("%d", &n);
12
    for (int i = 1; i <= n; ++i) {
13
        for (int j = 1; j <= n; ++j) {
14
            scanf("%lld", &s[i][j]);
15
            s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
16
        }
17
    }
18
    int res = 0;
19
    for (int i = 2; i < n; ++i) {
20
        for (int j = 2; j < n; ++j) {
21
            if (s[i - 1][n] == s[n][n] - s[i][n] && s[n][j - 1] == s[n][n] - s[n][j]) {
22
                res++;
23
            }
24
        }
25
    }
26
    printf("%d\n", res);
27
    return 0;
28
}

1
#include <iostream>
2

3
using namespace std;
4

5
const int N = 1000010;
6
int a[N], f[N][2];
7

8
int main() {
9
    int n;
10
    scanf("%d", &n);
11
    for (int i = 1; i <= n; ++i) {
12
        scanf("%d", &a[i]);
13
    }
14
    int res = 1;
15
    f[1][0] = 1;
16
    for (int i = 2; i <= n; ++i) {
17
        if (a[i] == a[i - 1]) f[i][0] = f[i - 1][0] + 1, f[i][1] = f[i - 1][1] + 1;
18
        else f[i][0] = 1;
19
        if (i == 2) f[i][1] = 2;
20
        else if (a[i] == a[i - 2]) f[i][1] = max(f[i][1], f[i - 2][0] + 2);
21
        res = max(res, max(f[i][0] + 1, f[i][1]));
22
    }
23
    printf("%d\n", min(res, n));
24
    return 0;
25
}