Cod sursa(job #139260)
Utilizator | mihai pegulescu pegu | Data | 19 februarie 2008 21:19:10 |
---|---|---|---|
Problema | Substr | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream.h>
char a[100];
int verif(int p,int j,int i){
for(int k=0;k<i;k++)
if(a[p+k]!=a[j+k]) return 0;
return 1;
}
int main(){
ifstream f("substr.in");
ofstream g("substr.out");
int i,j,n,k,p,sol=1,x=0;
f>>n>>k;
for(i=0;i<n;i++)
f>>a[i];
for(i=n/k;i>0;i--)
for(p=0;p<=n-i;p++)
{for(j=p+i;j<=n-i;j++)
if(verif(p,j,i)) {sol++; j+=i-1; }
if(sol>=k) {g<<i;
i=0;p=n+1;j=n+1;break;}
sol=1;
}
return 0;}