Cod sursa(job #409073)
Utilizator | Data | 3 martie 2010 13:48:19 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <string>
using namespace std;
string minta,szoveg;
long k;
int main()
{
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in >> minta;
in >> szoveg;
k=szoveg.find(minta,0);
while (k!=string::npos)
{
out << k+1 << "\n";
k=szoveg.find(minta,k+1);
}
return 0;
}