CF2193 Round 1078 (Div. 2)

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
int T, n, k;
25
void solve() {
26
    cin >> n >> k;
27
    cout << 1ll * (n / k) * (k - 1) + (n % k) << endl;
28
}
29
signed main() {
30
    ios::sync_with_stdio(0);
31
    cin.tie(0);
32
    cout.tie(0);
33
    cin >> T;
34
    while(T--) solve();
35
    return 0;
36
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
const int N = 2e5 + 5;
25
int T, n, x, y, a[N];
26
void solve() {
27
    cin >> n >> x >> y;
28
    ll ans = 0, res = 0;
29
    for(int i = 1;i <= n;i++) {
30
        cin >> a[i];
31
        if(i > 1) res += 1ll * y * (a[i] / x);
32
    }
33
    res += a[1];
34
    ans = max(ans, res);
35
    for(int i = 2;i <= n;i++) {
36
        res -= a[i - 1];
37
        res -= 1ll * y * (a[i] / x);
38
        res += 1ll * y * (a[i - 1] / x);
39
        res += a[i];
40
        ans = max(ans, res);
41
    }
42
    cout << ans << endl;
43
}
44
signed main() {
45
    ios::sync_with_stdio(0);
46
    cin.tie(0);
47
    cout.tie(0);
48
    cin >> T;
49
    while(T--) solve();
50
    return 0;
51
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
const int N = 5e4 + 5;
25
int T, n, m;
26
string s[N];
27
vector<int> d;
28
void solve() {
29
    cin >> n >> m;
30
    for(int i = 0;i < m;i++) {
31
        cin >> s[i];
32
    }
33
    d.clear();
34
    d.push_back(1);
35
    d.push_back(n);
36
    for(int i = 2;i * i <= n;i++) if(n % i == 0) {
37
        d.push_back(i);
38
        if(i * i != n) d.push_back(n / i);
39
    }
40
    sort(d.begin(), d.end());
41
    for(auto k : d) {
42
        // cout << "k = " << k << endl;
43
        int cnt = n / k;
44
        vector<int> st(k + 5, ((1 << 26) - 1));
45
        for(int i = 0;i < n;i++) {
46
            int S0 = 0;
47
            for(int j = 0;j < m;j++) {
48
                S0 |= (1 << (s[j][i] - 'a'));
49
            }
50
            // cout << "S0 = " << S0 << endl;
51
            st[i % k] &= S0;
52
            // printf("st[%d] = %d\n", i % k, st[i % k]);
53
        }
54
        int valid = 1;
55
        for(int i = 0;i < k;i++) {
56
            if(st[i] == 0) valid = 0;
57
        }
58
        if(valid) {
59
            string ans;
60
            ans.resize(k);
61
            for(int i = 0;i < k;i++) {
62
                for(int j = 0;j < 26;j++) if(st[i] & (1 << j)) {
63
                    ans[i] = 'a' + j;
64
                    break;
65
                }
66
            }
67
            for(int i = 1;i <= cnt;i++) cout << ans;
68
            cout << endl;
69
            return;
70
        }
71
    }
72
}
73
signed main() {
74
    ios::sync_with_stdio(0);
75
    cin.tie(0);
76
    cout.tie(0);
77
    cin >> T;
78
    while(T--) solve();
79
    return 0;
80
}