Cod sursa(job #2122761)
| Utilizator | Data | 5 februarie 2018 14:25:04 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.78 kb |
#include <fstream>
#include <cstring>
using namespace std;
FILE *f,*g;
char a[2000002],b[2000002];
int sol[1002];
int main()
{
int n,m,i,s,d,solutie=0,nr;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in>>a>>b;
n=strlen(a);
m=strlen(b);
nr=0;
for(i=0;i<m;i++)
{
if(b[i]==a[0])
{
s=i;
d=0;
while(b[s]==a[d]&&s<m&&d<n)
{
s++;
d++;
}
if(d==n)
{
solutie++;
if(nr<1000)
sol[++nr]=i;
}
}
}
out<<solutie<<"\n";
for(i=1;i<=min(1000,solutie);i++)
{
out<<sol[i]<<" ";
}
return 0;
}
