QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#791261 | #9568. Left Shifting 3 | imwinter# | WA | 3ms | 3848kb | C++20 | 747b | 2024-11-28 17:44:50 | 2024-11-28 17:44:52 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
void sol() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'n' && s.substr(i, 7) == "nanjing") {
cnt++;
}
}
if (n <= 7) {
std::cout << cnt << "\n";
return;
}
for (int p = 1; p <= 6; p ++) {
if (s.substr(n - (7 - p), 7 - p) + s.substr(0, p) == "nanjing" && p <= k) {cnt++;};
}
std::cout << cnt << "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int _ = 1;
std::cin >> _;
while (_--) {
sol();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3848kb
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: 3ms
memory: 3672kb
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 4 3 4 0 2 4 3 2 1 1 1 4 2 0 3 3 0 0 1 0 0 0 5 4 0 1 2 1 2 2 1 1 1 3 3 1 3 2 0 1 2 4 1 2 1 2 1 2 3 0 1 0 0 1 1 3 2 2 1 0 3 1 2 1 1 4 4 1 1 1 1 0 1 1 1 1 2 0 4 4 3 1 0 2 1 1 1 1 5 1 4 0 1 2 1 3 4 3 3 3 3 1 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 2 0 1 1 2 2 2 1 0 3 ...
result:
wrong answer 90th numbers differ - expected: '1', found: '0'