QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #735084 | #9568. Left Shifting 3 | UESTC_NLNS# | WA | 8ms | 3760kb | C++20 | 523b | 2024-11-11 17:12:53 | 2024-11-11 17:12:54 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T,n,m,ans,ansp;
string a,b,p="nanjing";
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>T;
while(T--)
{
cin>>n>>m>>a;ans=ansp=0;
if(n<=6) {cout<<"0\n";continue;}
for(int i=0;i+6<n;i++)
{
b="";
for(int j=i;j<i+7;j++) b+=a[j];
if(b==p) ans++;
}
for(int i=n-min(m,6);i<n;i++)
{
b="";
for(int j=i,k=0;k<7;j=(j+1)%n,k++) b+=a[j];
if(b==p) ansp=1;
}
cout<<ans+ansp<<"\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
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: 8ms
memory: 3760kb
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 2 2 1 3 3 3 3 4 0 2 4 3 2 1 1 1 4 2 0 3 3 1 0 1 0 0 0 5 4 0 1 2 1 2 2 1 1 1 2 3 1 3 2 0 1 1 4 1 1 1 2 1 2 3 0 1 1 0 1 1 3 2 2 1 0 2 1 2 1 1 3 4 1 1 1 1 0 0 1 1 1 2 0 4 4 3 1 1 2 1 1 1 1 5 1 4 1 1 2 0 2 4 3 3 3 3 0 3 2 1 3 1 2 0 0 1 0 5 0 2 0 3 1 1 2 2 3 2 1 2 0 1 1 1 2 4 1 3 2 1 1 1 2 2 2 1 0 3 ...
result:
wrong answer 3rd numbers differ - expected: '3', found: '2'