Pagini recente » Cod sursa (job #325655) | Cod sursa (job #1688057) | Cod sursa (job #44105) | Cod sursa (job #2628873) | Cod sursa (job #1229592)
#include <cstdio>
#include <string>
#include <fstream>
using namespace std;
int v[2000000];
string s1,s2;
int main()
{
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in >>s1>>s2;
int i,j,cnt,n,m;
n=s1.size();
m=s2.size();
cnt=0;
if(n>m)
{
for(i=0;i<n-m+1;i++)
{
for(j=0;j<m;j++)
{
if(s1[i+j]!=s2[j])
break;
}
if(j==m)
v[++cnt]=i;
}
}
else
{
for(i=0;i<m-n+1;i++)
{
for(j=0;j<n;j++)
{
if(s2[i+j]!=s1[j])
break;
}
if(j==n)
v[++cnt]=i;
}
}
out << cnt<< endl;
for(i=1;i<=cnt;i++)
out << v[i]<<" ";
return 0;
}