Cod sursa(job #403083)
Utilizator | Data | 24 februarie 2010 16:41:49 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main ()
{
int v[1010];
string a,b;
getline(in,a);
getline(in,b);
int poz = -1;
int n = b.size();
int k=0,find = 1;
while(poz<n&&find >-1)
{
find = -1;
find = b.find(a,poz+1);
poz = find;
if(poz>-1)
{
v[k]=poz;
k++;
}
}
out<<k<<'\n';
for(poz=0;poz<k%1000;poz++)
out<<v[poz]<<" ";
return 0;
}