QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#735221#9568. Left Shifting 3ucup-team1412#TL 0ms3656kbC++14589b2024-11-11 18:26:572024-11-11 18:26:57

Judging History

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

  • [2024-11-11 18:26:57]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:3656kb
  • [2024-11-11 18:26:57]
  • 提交

answer

#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
#define endl '\n'
const int maxn=1e5+10;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        int n,k;
        cin>>n>>k;
        string s;
        cin>>s;
        for(int i=0;i<k;i++){
            s=s+s[i];
        }

        int pos=s.find("nanjing",0);
        int cnt=0;
        while(pos!=-1){
            cnt++;
            pos=s.find("nanjing",pos+7);
        }
        cout<<cnt<<endl;

    }


    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3656kb

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
Time Limit Exceeded

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:


result: