算是很难的题目了
准备测试数据
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#...
阅读全文
递归和排列
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
#include <stdio.h>
#define SIZE 10
int print_permulation(int n, int A[], int cur)
{
int i, j;
int ok;
if (cur==n) {
for (i=0; i<n; i++) printf("%d ", A[i]);
printf("n")...
阅读全文
穷举法
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include <stdio.h>
int main(int argc, char *argv[])
{
int k, x, y;
int i;
k = 12;
for (x=k+1; x<=2*k; x++) {
y = k*x/(x-k);
if (y*(x-k)==k*x)
printf("1/%d=1/%d+1/%dn", k, x, y);
}
return 0;
}#include <stdio.h>
int...
阅读全文
穷举法
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
#include <stdio.h>
int is_diff_digits(int n, int len)
{
int a[9];
int i, j;
for(i=0; i<len; i++) a[i] = 0;
for(i=0; i<len; i++) {
a[i] = n % 10;
n = n / 10;
}
for (i=0; i<len...
阅读全文
