1
#include<bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5
const int maxn = 1e6 + 17;
6

7
int T, n, m, ans;
8
int a[maxn];
9
string str;
10

11
int main() {
12
  cin >> T;
13
  while(T--) {
14
    cin >> n;
15
    ans = n / 10;
16
    if(n % 10 == 9) ans++;
17
    cout << ans << endl;
18
  }
19
  return 0;
20
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5
const int maxn = 1e6 + 17;
6

7
int T, n, m, ans;
8
int a[maxn];
9
string s, t;
10

11
int main() {
12
  cin >> T;
13
  while(T--) {
14
    cin >> s >> t;
15
    int flg = 0;
16
    int sl = s.length();
17
    int len = t.length();
18
    for(int i = 0; i < len; i++) {
19
      string l = t.substr(0, i + 1);
20
      string r = t.substr(i + 1, len - i - 1);
21
      reverse(r.begin(), r.end());
22
      int lenl = l.length(), lenr = r.length();
23
      for(int j = 0; j + i < sl; j++) {
24
        if(l == s.substr(j, i + 1) && j + i - lenr >= 0) {
25
          if(r == s.substr(j + i - lenr, lenr)) flg = 1;
26
        }
27
      }
28
    }
29
    cout << (flg ? "YES" : "NO") << endl;
30
  }
31
  return 0;
32
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5
const int maxn = 1e6 + 17;
6

7
int T, n, m, ans;
8
int a[maxn], r[2], s[2];
9
string str;
10

11
int main() {
12
  cin >> T;
13
  while(T--) {
14
    ans = 10;
15
    cin >> str;
16
    for(int i = 1; i <= 10; i++) {
17
      if(str[i - 1] == '1') a[i] = 1;
18
      else if(str[i - 1] == '0') a[i] = 0;
19
      else a[i] = -1;
20
    }
21
    r[1] = 5, r[0] = 5, s[1] = 0, s[0] = 0;
22
    for(int i = 1; i <= 10; i++) {
23
      if(a[i] == 1) {
24
        s[i & 1]++, r[i & 1]--;
25

26
      }
27
      else if(a[i] == 0) {
28
        r[i & 1]--;
29
      }
30
      else{
31
        if(i & 1) {
32
          s[i & 1]++, r[i & 1]--;
33
        }
34
        else{
35
          r[i & 1]--;
36
        }
37
      }
38
      // cout << s[1] << r[1] << s[0] << r[0] << endl;
39
      if(s[1] - s[0] > r[0] || s[0] - s[1] > r[1]) {
40
        ans = min(ans, i);
41
        break;
42
      }
43
    }
44
    r[1] = 5, r[0] = 5, s[1] = 0, s[0] = 0;
45
    for(int i = 1; i <= 10; i++) {
46
      if(a[i] == 1) {
47
        s[i & 1]++, r[i & 1]--;
48

49
      }
50
      else if(a[i] == 0) {
51
        r[i & 1]--;
52
      }
53
      else{
54
        if(i & 1) {
55
          r[i & 1]--;
56
        }
57
        else{
58
          s[i & 1]++, r[i & 1]--;
59
        }
60
      }
61
      // cout << s[1] << r[1] << s[0] << r[0] << endl;
62
      if(s[1] - s[0] > r[0] || s[0] - s[1] > r[1]) {
63
        ans = min(ans, i);
64
        break;
65
      }
66
    }
67
    cout << ans << endl;
68
  }
69
  return 0;
70
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5

6
int T, n, m, ans;
7
string s, t;
8

9
int main() {
10
  cin >> T;
11
  while(T--) {
12
    int flg = 0;
13
    cin >> s >> t;
14
    int ls = s.length(), lt = t.length();
15
    int ps = 0, pt = 0;
16
    while(ps < ls && s[ps] != t[0]) ps += 2;
17
    // cout << ps << endl;
18
    for(; ps < ls && pt < lt; ) {
19
      while(s[ps + 1] == t[pt + 1] && ps < ls && pt < lt) ps++, pt++;
20
      ps += 2;
21
    }
22
    // cout << pt << endl;
23
    if(pt == lt) flg = 1;
24
    ps = 1, pt = 0;
25
    while(ps < ls && s[ps] != t[0]) ps += 2;
26
    // cout << ps << endl;
27
    for(; ps < ls && pt < lt; ) {
28
      while(s[ps + 1] == t[pt + 1] && ps < ls && pt < lt) ps++, pt++;
29
      ps += 2;
30
    }
31
    // cout << pt << endl;
32
    if(pt == lt) flg = 1;
33
    cout << (flg ? "YES" : "NO") << endl;
34
  }
35
  return 0;
36
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5

6
const int maxn = 3e5 + 17;
7
int T, n, m, ans;
8
vector<int> v;
9
int a[maxn], cnt[maxn], fa[maxn];
10

11
int getf(int x) {
12
  return fa[x] == x ? x : (fa[x] = getf(fa[x]));
13
}
14

15
void merge(int x, int y) {
16
  int fx = getf(x), fy = getf(y);
17
  if(fx == fy) return;
18
  fa[fy] = fx;
19
  return;
20
}
21

22
int main() {
23
  cin >> T;
24
  while(T--) {
25
    ans = 0;
26
    v.clear();
27
    cin >> n >> m;
28
    for(int i = 0; i <= n; i++) cnt[i] = 0;
29

30
    for(int i = 1; i <= n; i++) cin >> a[i];
31
    for(int i = 1; i <= n; i++) {
32
      cnt[(i - a[i] + n) % n]++;
33
    }
34
    for(int k = 0; k < n; k++) if(cnt[k] >= n - 2 * m) {
35
      int tmp = 0;
36
      for(int i = 1; i <= n; i++) fa[i] = i;
37
      for(int i = 1; i <= n; i++) {
38
        int to = ((i - k + n) % n);
39
        if(!to)  to = n;
40
        // if(to == a[i]) fa[to] = 0;
41
        merge(a[i], to);
42
      }
43
      // for(int i = 1; i <= n; i++) cout << getf(i) << " \n"[i == n];
44
      for(int i = 1; i <= n; i++) {
45
        if(getf(i) == i) tmp++;
46
      }
47
      if(n - tmp <= m) ans++, v.push_back(k);
48
    }
49
    cout << ans;
50
    int len = v.size();
51
    cout << (len ? " " : "\n");
52
    for(int i = 0; i < len; i++) cout << v[i] << " \n"[i == len - 1];
53
  }
54
  return 0;
55
}