Cod sursa(job #583179)
| Utilizator | Data | 18 aprilie 2011 17:05:00 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
string a,b;
int p[200000],nr;
int main()
{
ifstream in("strmatch.in");
in>>a>>b;
in.close();
int pos=-1;
pos=b.find(a,pos+1);
if(pos!=string::npos)
p[nr++]=pos;
while(pos!=string::npos)
{
pos=b.find(a,pos+1);
if(pos!=string::npos)
p[nr++]=pos;
}
ofstream out("strmatch.out");
out<<nr<<'\n';
for(int i=0;i<nr;i++)
out<<p[i]<<' ';
out<<'\n';
out.close();
return 0;
}
