QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #758569 | #9568. Left Shifting 3 | lonelywolf# | WA | 4ms | 3676kb | C++20 | 678b | 2024-11-17 18:52:04 | 2024-11-17 18:52:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n, k;
cin >> n >> k;
string s;
cin >> s;
s = s + s.substr(0, min(k, 6ll));
int ans = 0;
for (int i = 0; i + 7 < s.length(); ++i) {
ans += s.substr(i, 7) == "nanjing";
// cerr << s.substr(i, 7) << '\n';
}
cout << ans << '\n';
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
/*
4
21 10
jingicpcnanjingsuanan
21 0
jingicpcnanjingsuanan
21 3
nanjingnanjingnanjing
4 100
icpc
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3600kb
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: 4ms
memory: 3676kb
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:
3 0 3 2 2 3 3 3 3 4 0 2 4 3 2 1 1 0 4 2 0 3 3 0 0 1 0 0 0 5 4 0 1 2 1 2 2 1 1 1 2 3 1 3 1 0 1 2 4 1 2 1 2 0 2 3 0 1 0 0 1 1 3 2 2 1 0 3 1 1 1 1 4 4 1 1 1 1 0 1 1 1 1 2 0 4 4 3 0 0 2 1 1 1 1 5 1 4 0 1 2 0 3 4 3 3 3 3 0 3 2 1 3 1 2 0 0 1 0 5 0 2 0 3 1 0 2 2 3 2 1 2 0 1 1 1 2 4 1 3 1 0 1 1 2 2 2 1 0 3 ...
result:
wrong answer 8th numbers differ - expected: '4', found: '3'