Cod sursa(job #1588072)
Utilizator | Data | 2 februarie 2016 19:33:29 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 14 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string A,B;
int i,k;
size_t n,oo=string::npos,sol[1010];
int main()
{
for(f>>A>>B,n=oo;;){n=B.find(A,n+1);if(n==oo)break;k++;if(k<=1000)sol[k]=n;}
for(g<<k<<'\n',i=1;i<=k;i++)g<<sol[n]<<' ';
return 0;
}