blob: 71c19bdfe7048f8b80411e8b6ed2f9558da15e65 (
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
|
#include <stdio.h>
struct cube
{
long long minc;
int nc;
};
struct cube cubes[10000000];
int ncubes;
int isperm(long long x, long long y)
{
int a[10];
for (int i = 0; i < 10; i++)
a[i] = 0;
while (x) {
a[x%10]++;
x /= 10;
}
while (y) {
a[y%10]--;
y /= 10;
}
for (int i = 0; i < 10; i++) {
if (a[i] != 0)
return 0;
}
return 1;
}
int main()
{
ncubes = 0;
int i = 0;
while (1) {
long long t = (long long)i*i*i;
int hasperm = 0;
for (int j = 0; j < ncubes; j++) {
if (isperm(cubes[j].minc, t)) {
cubes[j].nc++;
if (cubes[j].nc == 5) {
printf("%lld\n", cubes[j].minc);
return 0;
}
hasperm = 1;
break;
}
}
if (hasperm == 0) {
cubes[ncubes].minc = t;
cubes[ncubes].nc = 1;
ncubes++;
}
i++;
}
}
|