-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1079.c
58 lines (51 loc) · 1.15 KB
/
1079.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include<stdio.h>
#include<string.h>
int palin(char A[]); //判断是否为回文数
void change(char A[]); //逆转变换
int main()
{
char A[1011] = {0};
scanf("%s", A);
if(palin(A)){
printf("%s is a palindromic number.", A);
return 0;
}else{
for(int i = 0; i < 10; i++){
change(A);
if(palin(A)){
printf("%s is a palindromic number.", A);
return 0;
}
}
}
printf("Not found in 10 iterations.");
return 0;
}
int palin(char A[]){
int len = strlen(A);
for(int i = 0; i < len / 2; i++){
if(A[i] != A[len - i - 1]){
return 0;
}
}
return 1;
}
void change(char A[]){
printf("%s", A);
char C[1011] = {0};
int len = strlen(A);
for(int i = 0; i < len; i++){
C[i] = A[len - 1 - i];
}
int sum, carry = 0;
for(int i = len - 1; i >= 0; i--){
sum = A[i] + C[i] - '0' - '0' + carry;
A[i] = sum % 10 + '0';
carry = sum / 10;
}
if(carry){
memmove(A + 1, A, len + 1);
A[0] = carry + '0';
}
printf(" + %s = %s\n", C, A);
}