Cod sursa(job #1653675)
| Utilizator | Data | 16 martie 2016 13:35:53 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <string.h>
#include <queue>
#define LIM 1000
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int NMAX = 2000001;
char a[NMAX],b[NMAX];
char *p;
int nr = 0;
queue<int> coada;
int main()
{
in.getline(a,NMAX);
in.getline(b,NMAX);
p = strstr(b,a);
while(p && nr<LIM)
{
nr++;
coada.push(p-b);
p = strstr(p+1,a);
}
out<<nr<<"\n";
while(!coada.empty())
{
out<<coada.front()<<" ";
coada.pop();
}
out.close();
return 0;
}
