Cadena palíndromo de programación en lenguaje C
#include
main()
{ int n,n1,x,y=0,m=0,i,j ,k,tong;
char *a,b[27],ch,dan=0;
printf("n="
scanf ("%d",&n);
a=(char *)malloc(sizeof(char)*n+1; p> p>
b[0]=0;
scanf("%s",a
for(i=0,k=0;i<); n; i++)
{
tong=0
for(j=0;b[j]!=0;j++)
if(a[i]==b[j])tong=1
if(tong==0)
{
para (j =i+1,x=1;j if(a[i]==a[j])x++ if(x%; 2= =1) { dan=a[i] y++; > if (y==2) { printf("Imposible\n\n"); exit(0); } b[k]=a[i]; b[k+1]=0 k++; } } for(i=0;i { si( dan! =0) if(a[i]==dan) { ch=a[i]; > a[i]=a[i+1]; a[i+1]=ch m++; for(j=n-1-i;j>i;j--) if(a[i]==a[j]) { romper; } for(k=j;k { ch=a[k]; a[k]=a[k+1] a[k+1]=ch; m++; } } printf("%s\n %d\n\n",a,m); p> getch(); }