Pagini recente » Cod sursa (job #2934777) | Cod sursa (job #2335815) | Cod sursa (job #2070772) | Cod sursa (job #628240) | Cod sursa (job #2302973)
#include <fstream>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
const int NMax = 2000000;
int N,Sol[1005];
char A[NMax + 5], B[NMax + 5];
int main()
{
fin.getline(A,NMax+5);
fin.getline(B,NMax+5);
for(int i = 0; B[i]; ++i)
{
int Ok = 1;
for(int j = 0; A[j]; ++j)
{
if(B[i+j] != A[j])
Ok = 0;
}
if(Ok)
{
N++;
if(N <= 1000)
Sol[N] = i;
}
}
fout << N << "\n";
for(int i = 1; i <= min(N,1000); ++i)
fout << Sol[i] << " ";
fout << "\n";
return 0;
}