Pagini recente » Cod sursa (job #2030561) | Cod sursa (job #1352066) | Cod sursa (job #1542145) | Cod sursa (job #1467489) | Cod sursa (job #37872)
Cod sursa(job #37872)
#include<stdio.h>
#include<string.h>
char s[2005],max[2005],aux[2005];
int n,ck;
int palindrom(char s[2005])
{
char cs[20005];
strcpy(cs,s);
strrev(cs);
if (strcmp(s,cs)==0)
return 1;
else
return 0;
}
void rezolv(int ex,char s[2005],int k)
{ int i;
if ((!ex || (ex==1 && k>=ck)) && k>0)
{
for (i=0;i<k;i++)
{
strcpy(aux,s);
aux[i]=0;
strcat(aux,s+i+1);
if (palindrom(aux))
if ((max[0]==0 || (strcmp(max,aux)<0)) && aux[0]!='0')
strcpy(max,aux),ck=k,ex=1;
rezolv(ex,aux,k-1);
}
}
}
int main()
{
freopen("elimin2.in","r",stdin);
freopen("elimin2.out","w",stdout);
scanf("%s",s);
if (palindrom(s))
printf("%s",s);
else
{ n=strlen(s);
rezolv(0,s,n);
printf("%s",max);
}
fcloseall();
return 0;
}