CF2193 Round 1079 (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, x;
25
int d(int x) {
26
    int res = 0;
27
    while(x) {
28
        res += x % 10;
29
        x /= 10;
30
    }
31
    return res;
32
}
33
void solve() {
34
    cin >> x;
35
    int ans = 0;
36
    for(int i = x;i <= x + 100;i++) {
37
        if(x + d(i) == i) ans++;
38
    }
39
    cout << ans << endl;
40
}
41
signed main() {
42
    ios::sync_with_stdio(0);
43
    cin.tie(0);
44
    cout.tie(0);
45
    cin >> T;
46
    while(T--) solve();
47
    return 0;
48
}

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, p[N], a[N];
26
void solve() {
27
    cin >> n;
28
    for(int i = 1;i <= n;i++) cin >> p[i];
29
    for(int i = 1;i <= n;i++) cin >> a[i];
30
    int pos = 1;
31
    for(int i = 1;i <= n;i++) {
32
        while(pos <= n && p[pos] != a[i]) {
33
            pos++;
34
        }
35
        if(pos > n && p[n] != a[i]) {
36
            cout << "NO" << endl;
37
            return;
38
        }
39
    }
40
    cout << "YES" << endl;
41
}
42
signed main() {
43
    ios::sync_with_stdio(0);
44
    cin.tie(0);
45
    cout.tie(0);
46
    cin >> T;
47
    while(T--) solve();
48
    return 0;
49
}