Pagini recente » Cod sursa (job #1907706) | Cod sursa (job #2370372) | Cod sursa (job #1963727) | Cod sursa (job #2952984) | Cod sursa (job #1687136)
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
ifstream q("strmatch.in");
ofstream w("strmatch.out");
char s[2000100],d[2000100];
int rasp[2000100];
int verif(int i,int j,int n)
{
for(i=1;i<=n;i++)
{
if(s[i]!=d[j+i]) return 0;
}
return 1;
}
int main()
{int n,m,i=0,j;
q.getline(s,2000000);
q.getline(d,2000000);
n=strlen(s);
m=strlen(d);
///
for(j=0;j<m;j++)
if(s[0]==d[j])
if(verif(1,j,n-1)) {rasp[++i]=j;j++;}
w<<i<<"\n";
for(n=1;n<=i&&n<=1000;n++) w<<rasp[n]<<" ";
return 0;
}