Pagini recente » Cod sursa (job #1301864) | Cod sursa (job #763257) | Cod sursa (job #1752890) | Cod sursa (job #1865626) | Cod sursa (job #1597214)
#include <iostream>
#include <fstream>
#include <string.h>
#include <algorithm>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char s1[2000003];
char s2[2000003];
int val[1003];
char *p1 = s1;
char *p2 = s2;
int cnt;
int main() {
in.getline(s1, 2000003);
in.getline(s2, 2000003);
string A(p1);
string B(p2);
int len1 = strlen(s1);
int len2 = strlen(s2);
int c = B.find(A, 0);
while(c != string::npos) {
if(cnt < 1001)
val[cnt++] = c;
else
cnt++;
c = B.find(A, c+1);
}
out << cnt << '\n';
for(int i = 0; i < cnt; i++) {
if(i == 1000)
break;
out << val[i] << " ";
}
return 0;
}