QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#398271#3761. 2020SamponYW#AC ✓16ms3960kbC++141.3kb2024-04-25 10:12:082024-04-25 10:12:09

Judging History

你现在查看的是最新测评结果

  • [2024-04-25 10:12:09]
  • 评测
  • 测评结果:AC
  • 用时:16ms
  • 内存:3960kb
  • [2024-04-25 10:12:08]
  • 提交

answer

#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 505
#define P 1000000007
il int add(int x, int y) {return x + y < P ? x + y : x + y - P;}
il void addr(int &x, int y) {(x += y) >= P && (x -= P);}
il int qpow(int p, int n = P - 2) {
  int s = 1;
  while(n) {
    if(n & 1) s = 1ll * s * p % P;
    p = 1ll * p * p % P, n >>= 1;
  }
  return s;
}
const int mu = qpow(1e4);
int n; string str;
il void WORK() {
  str = " " + str; int s = 0;
  FOR(i, 1, n - 3) {
    if(str.substr(i, 4) == "2020") ++s, i += 3;
  }
  cout << s << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  while(cin >> n >> str) WORK();
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}

详细

Test #1:

score: 100
Accepted
time: 16ms
memory: 3960kb

input:

4
2020
6
202020
10
1202012020
10
2222220000
10
0221200202
10
2202021022
10
0200222200
10
2222022122
10
2122222220
10
2200200002
10
2022222222
10
0000020220
10
0220022200
10
2020012000
10
0020020022
10
2220000020
10
0100220202
10
2202021022
10
0220222022
10
0220020000
10
0200000002
10
0202020002
10
2...

output:

1
1
2
0
0
1
0
0
0
0
0
0
0
1
0
0
1
1
0
0
0
1
0
1
1
1
0
1
0
0
0
0
0
1
0
0
1
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
1
0
0
0
0
0
0
0
1
1
0
0
0
0
1
0
1
2
0
1
1
0
0
0
0
1
1
0
1
1
0
0
0
1
0
0
1
0
1
0
1
1
0
0
1
1
0
0
0
1
0
0
0
1
1
0
0
1
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
1
1
0
0
2
1
...

result:

ok 11116 lines