Cod sursa(job #182084)
Utilizator | Ungureanu Daniel GooDy | Data | 20 aprilie 2008 12:50:12 |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <string>
ifstream f("strmatch.in");
ofstream g("strmatch.out");
const long max = 10000;
char a[max],b[max],*p=b;
int n,m;
int main()
{
f.getline(a,max);
f.getline(b,max);
n=strlen(a);
m=strlen(b);
int i,nr=0,c[1000];
float ok;
for(i=1;(i<=m-n+1)&&(nr<1000);i++)
{
if (strncmp(a,p,n)==0)
{
nr++;
c[nr]=i-1;
}
p++;
}
g<<nr<<endl;
for(i=1;i<=nr;i++)
g<<c[i]<<" ";
return 0;
}