Pagini recente » Cod sursa (job #657904) | Cod sursa (job #360619) | Cod sursa (job #74511) | Cod sursa (job #1863006) | Cod sursa (job #38182)
Cod sursa(job #38182)
#include<stdio.h>
#include<string.h>
char n[100000000],ni[100000000],a[100000000];
int k;
int ver(char x[100000000])
{
strcpy(ni,x);
int i,j;
for( i=strlen(ni)-1, j=0;j<i;j++,i--)
{
int aux;
aux=ni[i];
ni[i]=ni[j];
ni[j]=aux;
}
// strrev(ni);
if(strcmp(x,ni)==0)
return 1;
else
return 0;
}
int max(int a,int b)
{
if(a>b)
return a;
return b;
}
void rezolva()
{
int x,y,i,j;
x=strlen(n);
y=strlen(ni);
for(i=x;i>0;i--)
n[i]=n[i-1];
for(i=y;i>0;i--)
ni[i]=ni[i-1];
for(i=1;i<=y;i++)
for(j=1;j<=x;j++)
if(ni[i]==n[j])
{
a[k++]=ni[i];
i++;
}
}
int main()
{
FILE *f=fopen("elimin2.in","r"),*g=fopen("elimin2.out","w");
fgets(n,1000000,f);
if(ver(n))
{
fprintf(g,"%s\n",n);
return 0;
}
rezolva();
for(int i=0;i<k;i++)
fprintf(g,"%c",a[i]);
printf("\n");
return 0;
}