blob: e4cd40c8578b2f93a6e1170eeacb2c3942464d03 (
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
|
#include <stdio.h>
int np(int p)
{
int n = 0;
int a;
/* p = a + b + c, with a*a+b*b=c*c */
/* b = (p*p-2pa)/(2p-2a) */
if (p % 2 == 1)
return 0;
a = 1;
while (1) {
int nu = p * (p - a*2);
int de = (p - a) * 2;
if (nu % de == 0 && nu/de > a)
n++;
if (nu/de < a)
break;
a++;
}
return n;
}
int main()
{
int bestp, M = 0;
int i;
for (i = 3; i<=1000; i++) {
int m = np(i);
if (m > M) {
bestp = i;
M = m;
}
}
printf("%d\n", bestp);
}
|