Pagini recente » Cod sursa (job #2989057) | Cod sursa (job #1548647) | Cod sursa (job #2207111) | Cod sursa (job #3194827) | Cod sursa (job #157806)
Cod sursa(job #157806)
#include <stdio.h>
#include <string.h>
int n,m,fib[19],ok=0;
char s[3027198];
void genfib(int n){
int i;
fib[0]=1;
fib[1]=1;
for(i=2;i<=n;i++)
fib[i]=fib[i-1]+fib[i-2];
}
void formsol(int x, int y){
int i,da=1,nr;
if(n%2==0){
for(i=0;i<y;i++)
if(s[x+y+i]!=s[i])
da=0;
for(i=y;i<x+y;i++)
if(s[i]!=s[x+y+i])
da=0;
if(da==1){
for(i=y;i<x+y;i++)
printf("%c",s[i]);
printf("\n");
for(i=0;i<y;i++)
printf("%c",s[i]);
ok=1;
}
}
else{
for(i=0;i<x;i++)
if(s[i]!=s[x+y+y+i])
da=0;
for(i=x;i<x+y;i++)
if(s[i]!=s[y+i])
da=0;
if(da==1){
for(i=0;i<x;i++)
printf("%c",s[i]);
printf("\n");
for(i=x;i<x+y;i++)
printf("%c",s[i]);
ok=1;
}
}
}
void equation(){
int i,j;
int nr1,nr2;
for(i=1;i<=m;i++){
nr1=i*fib[n-3];
nr2=((m-nr1)/fib[n-2])*fib[n-2];
if(nr1+nr2==m && nr1>0 && nr2>0)
formsol(nr1/fib[n-3],nr2/fib[n-2]);
}
}
int main(){
freopen("lampa.in","r",stdin);
freopen("lampa.out","w",stdout);
scanf("%d%d\n",&n,&m);
gets(s);
genfib(n);
equation();
if(ok==0)
printf("0\n");
fclose(stdout);
return 0;
}