Pagini recente » Cod sursa (job #1520411) | Cod sursa (job #1679187) | Cod sursa (job #1758675) | Cod sursa (job #3227554) | Cod sursa (job #1609270)
#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>
#define NMAX 2000003
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char s1[NMAX];
char s2[NMAX];
int val[1003], ct;
int main() {
fin.getline(s1, NMAX);
fin.getline(s2, NMAX);
string A(s1);
string B(s2);
int c = B.find(A, 0);
while(c != string::npos) {
if(ct < 1001)
val[ct++] = c;
else
ct++;
c = B.find(A, c+1);
}
fout<<ct<<'\n';
for(int i = 0; i < ct; ++i) {
if(i == 1000)
break;
fout<<val[i]<<' ';
}
}