QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#717843 | #9568. Left Shifting 3 | guangxuautumn | WA | 9ms | 3644kb | C++14 | 747b | 2024-11-06 19:05:44 | 2024-11-06 19:05:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve()
{
int n, k;
cin >> n >> k;
string s;
cin >> s;
s = s + s;
int cnt = 0;
string nanjing = "nanjing";
//cout << s << endl;
int last = min(n + min(k, 6), n * 2);
for(int i = 0; i < last; i ++) {
//cout << i << ' ';
if(s[i] == 'n' && i + 7 <= last) {
//cout << i << ' ';
bool flag = 0;
for(int j = i; j < 7; j ++) {
// cout << "what";
if(s[j] == nanjing[j - i]) continue;
else {
flag = 1;
break;
}
}
if(flag == 0) {
//cout << i << ' ';
cnt ++;
i = i + 6;
}
}
}
cout << cnt << '\n';
}
int main()
{
int t;
cin >> t;
while(t--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3532kb
input:
4 21 10 jingicpcnanjingsuanan 21 0 jingicpcnanjingsuanan 21 3 nanjingnanjingnanjing 4 100 icpc
output:
2 1 3 0
result:
ok 4 number(s): "2 1 3 0"
Test #2:
score: -100
Wrong Answer
time: 9ms
memory: 3644kb
input:
2130 39 7 nnananjingannanjingngnanjinganjinggjina 1 479084228 g 33 2 gqnanjinggrjdtktnanjingcvsenanjin 24 196055605 ginganjingnanjingnanjing 23 3 ngnanjinganjingjinnanji 40 3 njingaaznannanjingnananjingyonwpnanjinga 40 207842908 nanjinggphconanjingkonanjinannanjinglxna 46 3 ingjingnnanjingnanjinging...
output:
5 0 3 3 3 4 5 5 5 4 0 3 5 3 3 3 2 1 7 3 0 3 5 1 0 1 0 0 0 6 6 0 2 4 1 3 2 2 2 3 3 6 2 4 4 0 2 4 5 2 3 2 4 1 2 4 0 1 1 0 1 2 5 4 5 3 0 3 1 2 1 3 5 6 1 2 1 2 0 1 2 2 1 3 0 5 5 3 1 1 2 2 2 2 2 5 2 5 1 1 4 2 4 6 5 4 5 5 1 3 4 2 4 3 3 0 0 3 1 6 1 3 1 6 3 1 3 6 5 3 1 3 0 1 1 2 4 4 2 4 2 0 1 1 3 3 3 2 0 6 ...
result:
wrong answer 1st numbers differ - expected: '3', found: '5'