Cod sursa(job #701658)
| Utilizator | Data | 1 martie 2012 17:05:58 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
#include<iostream>
#include <string>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int main ()
{
char b[200001],a[20000];
f.getline(b,200000);
f.getline(a,200000);
long long i,j,s=0,aux,a1,a2,c[101],k=1;
i=0;
while(i<strlen(a)&&k<=100)
{
if(a[i]==b[0])
{ a1=i;
i++;
aux=i;
j=1;
while(a[i]==b[j]&&j<strlen(b))
{j++;
i++;
}
if(j==strlen(b))
{s=s+1;
c[k]=a1;
k++;
}
i=aux;
}
i++;
}
cout<<s<<"\n";
for(i=1;i<k;i++)
cout<<c[k]<<" ";
}
