Cod sursa(job #1083961)
Utilizator | Data | 16 ianuarie 2014 16:10:09 | |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 14 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#define NMax 2000000
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int N,M;
char A[NMax],B[NMax];
vector <int> Sol;
int main()
{
int i,j,ok;
fin>>A;
fin>>B;
for(i=0;A[i];i++)
{
ok=1;
for(j=0;B[j];j++)
if(A[i]!=B[j])
ok=0;
if(ok==1)
Sol.push_back(i);
}
fout<<Sol.size()<<"\n";
for(unsigned int i=0;i<Sol.size();i++)
fout<<Sol[i]<<" ";
fout<<"\n";
return 0;
}