Pagini recente » Cod sursa (job #2506209) | Cod sursa (job #1062370) | Cod sursa (job #1750036) | Cod sursa (job #2157270) | Cod sursa (job #420387)
Cod sursa(job #420387)
#include<fstream>
#include <stdio.h>
#include <string.h>
using namespace std;
long int m,n,poz[2000001];
char a[2000002],b[20000002];
int main(){
long int i,j,k,pos=1;
ifstream f("strmatch.in");
f>>a>>b;
f.close();
m=strlen(a);
n=strlen(b);
for(i=0;i<=n-1;i++)
{
j=0;
k=i;
while(j<=m-1&&a[j]==b[k])
{
k++;
j++;
}
if(j==m)
{
poz[pos++]=i;
}
}
freopen("strmatch.out","w",stdout);
printf("%o",pos-1);
printf("\n");
for(i=1;i<=pos-1;i++)
printf("%o ",poz[i]);
fclose(stdout);
return 0;
}