Cod sursa(job #1446980)
Utilizator | Grozescu Rares Ionut grares | Data | 3 iunie 2015 12:22:12 |
---|---|---|---|
Problema | Potrivirea sirurilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
const int Nmax = 1000;
char A[Nmax], B[Nmax];
int nr, C[Nmax],n,m;
int main()
{
f>>A>>B;
f.close();
nr=0;
n=strlen(A);
m=strlen(B)
for(int j=0;j<m-n;j++)
for(int i=0;i<n;i++)
if(B[i+j]==A[i] && B[i+j+1] == A[i+1] && B[i+j+2] == A[i+2])
{
C[nr]=j;
nr++;
}
g<<nr<<'\n';
for(int i=0;i<nr;i++)
g<<C[i]<<' ';
g.close();
return 0;
}