competitive-programming/solved-lightOj/1133.cpp at master · the-redback/competitive-programming · GitHub

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
#include <bits/stdc++.h>
using namespace std;

int main() {
    int i, j, t, k, r, temp, c, n;
    char ch;
    int a[202];
    scanf("%d", &t);
    for (j = 1; j <= t; j++) {
        scanf("%d %d", &n, &k);
        for (i = 0; i < n; i++) scanf("%d", &a[i]);

        for (i = 0; i < k; i++) {
            scanf(" %c", &ch);
            if (ch == 'S') {
                scanf("%d", &r);
                for (c = 0; c < n; c++) a[c] += r;
            } else if (ch == 'M') {
                scanf("%d", &r);
                for (c = 0; c < n; c++) a[c] *= r;
            } else if (ch == 'D') {
                scanf("%d", &r);
                for (c = 0; c < n; c++) a[c] /= r;
            } else if (ch == 'P') {
                scanf("%d %d", &r, &c);
                temp = a[r];
                a[r] = a[c];
                a[c] = temp;
            } else if (ch == 'R') {
                for (c = 0, r = n - 1; c < n / 2; c++, r--) {
                    temp = a[r];
                    a[r] = a[c];
                    a[c] = temp;
                }
            }
        }
        printf("Case %d:\n", j);
        for (i = 0; i < n; i++) {
            if (i != 0) printf(" ");
            printf("%d", a[i]);
        }
        printf("\n");
    }
    return 0;
}