Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #674212)
Utilizator | Data | 5 februarie 2012 20:03:17 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <string>
using namespace std;
string minta,szoveg;
int i,l,k,m[1010];
int main()
{
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in >> minta;
in >> szoveg;
l=0;
k=szoveg.find(minta,0);
while ((unsigned)k!=string::npos)
{
++l;
if (l<=1000) m[l]=k;
k=szoveg.find(minta,k+1);
}
out << l << "\n";
if (l>1000) l=1000;
for (i=1;i<=l;++i) out << m[i] << " ";
in.close();
out.close();
return 0;
}