题目:1024. Palindromic Number (25)
注意把内存开大点即可(最后一个测试点)
#include <stdio.h>
#include <string.h>
int jugefunction(char s[],int lenth)
{
int i=0;
while(s[i]==s[lenth-1-i]&&i<lenth/2)
++i;
if(i==lenth/2)return 1;
else return 0;
}
void reverse(char s[],char res[],int lenth)
{
int i=0,j=lenth-1;
while(i<lenth)
{
res[i]=s[j];
++i;--j;
}
res[lenth]='\0';
return;
}
void addfunction(char a[],char b[],char ans[],int lenth)
{
int i=lenth-1,surplus=0,j=0;
while(i>=0)
{
int temp=a[i]-'0'+b[i]-'0'+surplus;
ans[j]=temp%10+'0';
surplus=temp/10;
--i;++j;
}
if(surplus)ans[j++]=surplus+'0';
ans[j]='\0';
return;
}
int main()
{
char s[200];
int k;
scanf("%s %d",s,&k);
int n=k;
while(n--)
{
if(jugefunction(s,strlen(s)))
{
printf("%s\n%d",s,k-n-1);
return 0;
}
char res[200],addans[200];
reverse(s,res,strlen(s));
addfunction(s,res,addans,strlen(s));
reverse(addans,s,strlen(addans));
}
printf("%s\n%d",s,k);
return 0;
}