找名字

来源:互联网 发布:小号乐器知乎 编辑:程序博客网 时间:2024/04/28 05:56
#include<iostream>#include<string>using namespace std;int main(){int n;cin>>n;string u;getline(cin,u);while(n--){string s1,s2;getline(cin,s1);getline(cin,s2);string c;c.assign(s2,0,1);size_t p;int ans=0;p=s1.find_first_of(c); while(p!=string::npos && (p+s2.length()-1)<=s1.length()){int t=1;for(int i=0;i<s2.length();i++){if(s2[i]!=s1[(int)p+i]){ t=0; break;} }if(t) ans++;p=s1.find_first_of(c,p+s2.length()-1);}cout<<ans<<endl;} return 0;} 
#include<iostream>#include<string>using namespace std;int main(){int n;cin>>n;while(n--){string s1,s2;int i,j;getline(cin,s1);getline(cin,s2);int ans=0;for(i=0;i<s1.length()-s2.length()+1;){if(s1[i]==s2[0]){int same=0;for(j=1;j<s2.length();j++){if(s1[i+j]!=s2[j]) break;if(j==s2.length()-1) same=1;}if(same) i+=s2.length();else i++;if(same) ans++;}else{ i++; }}cout<<ans<<endl;}return 0;}