首页 > 代码库 > XidianOJ 1140 寻找万神

XidianOJ 1140 寻找万神

技术分享

--正文

直接用strstr就过了....

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

char str[10000000];
char str2[10000000];
int main(){
    int n;
    while (scanf("%d",&n) != EOF){
        scanf("%d",&n);
        int i;
        str[0] = \0;
        for (i=1;i<=n;i++){
            scanf("%s",str2);
            strcat(str,str2);            
        }
        char* now = str;
        long ans = 0;
        long len = strlen(str);
        while (now != NULL){
            now = strstr(now,"wanshen");
            if (now != NULL) {
                now ++;
            }
            else break;
            ans ++;
            if (now == \0) break;
        }    
        printf("%ld\n",ans);
    }
    return 0;
}

 

XidianOJ 1140 寻找万神