Cod sursa(job #1588038)
Utilizator | Erik Henning ErikHE | Data | 2 februarie 2016 19:09:20 |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
//ASSDHGFHGF
int main()
{
string a, b;
int poz[5000], i, nr=0;
f>>a;
f>>b;
int pos=0;
int n = b.find(a, pos);
while(n != string::npos) {
nr++;
poz[nr] = n;
pos = poz[nr];
n = b.find(a, pos+1);
}
g<<nr<<"\n";
for (i=1;i<=nr;i++)
g<<poz[i]<<"\t";
return 0;
}