blob: 093153558eb4fb7ae7e2abf248884a01862cb40c (
plain)
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
59
60
61
62
63
64
65
66
67
68
69
70
71
|
#include <stdio.h>
#include <stdlib.h>
#include "utils.h"
list_t *digits(int i)
{
list_t *lst = NULL;
while (i > 0)
{
int digit = i % 10;
i = i / 10;
lst = list_append_int(lst, digit);
}
return lst;
}
int is_palindrome(int i)
{
list_t *d = NULL;
int len = 0;
int j = 0;
if (i < 10)
return 1;
d = digits(i);
len = list_len(d);
// printf("i:%d\n", i);
for (j = 0; j < len/2; ++j)
{
int *a = (int*)list_get_n(d, j);
int *b = (int*)list_get_n(d, len-1-j);
// printf("a:%d b:%d\n", *a, *b);
if (*a != *b)
{
return 0;
}
}
list_free(d, list_free_int);
return 1;
}
int main(int argc, char **argv)
{
int i, j;
for (i = 999; i >= 900; i--)
{
for (j = 999; j >= 900; j--)
{
int k = i*j;
if (is_palindrome(k))
{
printf("%d * %d = %d\n", i, j, k);
return 0;
}
}
}
return 0;
}
|