contest of ACM Lesson(part3)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
#include <iostream>

using namespace std;

int main() {
    int t, n, k;
    cin >> t;
    while (t--) {
        cin >> n >> k;
        if (n % (k + 1))
            cout << "First" << endl;
        else 
            cout << "Second" << endl;
    }
    
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;
int t, n, m;
struct Node{
    int x, y, deep;
}st, ed, now, nxt;
const int MAX = 333;
queue <Node> que;
char mp[MAX][MAX];
bool used[MAX][MAX];
const int dir[4][2] = {1, 0, 0, 1, 0, -1, -1, 0};
int judge() {
    while (que.size()) que.pop();
    memset (used, 0, sizeof (used));
    que.push(st);
    used[st.x][st.y] = true;
    while (que.size()) {
        now = que.front(); que.pop();
        if (now.x == ed.x && now.y == ed.y)
            return now.deep;
        for (int i = 0; i < 4; ++i) {
            nxt.x = now.x + dir[i][0], nxt.y = now.y + dir[i][1];
            nxt.deep = now.deep + 1;
            if (nxt.x < 0 || nxt.y < 0 || nxt.x >= n || nxt.y >= m)
                continue;
            if (used[nxt.x][nxt.y])
                continue;
            if (mp[nxt.x][nxt.y] == '#')
                continue;
            used[nxt.x][nxt.y] = true, que.push(nxt);
        }
    }
    return -1;
}
int main() {
    cin >> t;
    while (t--) {
        cin >> n >> m;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cin >> mp[i][j];
                if (mp[i][j] == 'S')
                    st.x = i, st.y = j, st.deep = 0;
                else if (mp[i][j] == 'T')
                    ed.x = i, ed.y = j;
            }
        }
        cout << judge() << endl;
    }
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <iostream>
#include <vector>

using namespace std;
class Solution {
public:
    vector <int> ary;
    vector <int> cnt;
    int dfs(int now) {
        if (cnt[now] != -1) return cnt[now];
        cnt[now] = ary[now];
        if (now + 2 < ary.size()) cnt[now] = max(cnt[now], dfs(now + 2) + ary[now]);
        if (now + 3 < ary.size()) cnt[now] = max(cnt[now], dfs(now + 3) + ary[now]);
        if (now + 1 < ary.size()) cnt[now] = max(cnt[now], dfs(now + 1));
        return cnt[now];
    }
    int rob(vector<int>& nums) {
        if (nums.size() == 0) return 0;
        for (int i = 0; i < nums.size(); ++i) 
            ary.push_back(nums[i]), cnt.push_back(-1);
        return dfs(0);
    }
};
int main() {
    int t, n, k;
    cin >> t;
    while (t--) {
        cin >> n;
        vector <int> nums;
        for (int i = 0; i < n; ++i) {
            int tmp;
            cin >> tmp;
            nums.push_back(tmp);
        }
        Solution S;
        cout << S.rob(nums) << endl;
    }
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
#include <iostream>
using namespace std;
int a, b, c, n, t;
int main() {
    cin >> t;
    while (t--) {
        cin >> a >> b >> c >> n;
        cout << n / a + n / b + n / c 
                 - n / (a * b) - n / (a * c) - n / (b * c)
                  + n / (a * b * c) << endl;
    }
    return 0;
}