Cod sursa(job #154338)
| Utilizator | Data | 11 martie 2008 09:40:39 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
#include <string.h>
#define N 512
char v1[N],v2[N];
int main()
{
int max=0,nr=0,i,j,a,b;
freopen("subsir.in", "r",stdin);
freopen("subsir.out", "w",stdout);
scanf("%s", &v1);
scanf("%s", &v2);
a=strlen(v1);
b=strlen(v2);
for(i=0;i<a;++i)
for(j=0;j<b;++j)
{
if(v1[i]==v2[j])
{++nr; ++i;}
else
nr=0;
if(nr>max) max=nr;
}
printf("max=%d\n", max);
return 0;
}
