Pagini recente » Cod sursa (job #1501756) | Cod sursa (job #3262598) | Cod sursa (job #1480027) | Cod sursa (job #751280) | Cod sursa (job #139271)
Cod sursa(job #139271)
#include<fstream>
char a[16385];
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;
f>>n>>k;
for(i=0;i<n;i++)
f>>a[i];
f.close();
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; g.close();
return 0;}
sol=1;
}
g<<"0";
g.close()
return 0;}