如果把problem 9的那篇论文看了之后
算法也就出来了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <cmath>
#include <map>
#include <ctime>
#define MAXN 111111
#define INF 100000007
using namespace std;
int gao(int s)
{
int ans = 0;
int s2 = s / 2;
int m = (int)sqrt(s2 * 1.0) - 1;
for(int i = 2; i <= m; i++)
{
if(s2 % i == 0)
{
int sm = s2 / i;
while(sm % 2 == 0) sm /= 2;
int k;
if(i & 1) k = i + 2;
else k = i + 1;
while(k < 2 * i && k <= sm)
{
if(sm % k == 0 && __gcd(k, i) == 1) ans++;
k += 2;
}
}
}
return ans;
}
int main()
{
int ans = 0, pos = 12;
for(int i = 12; i <= 1000; i += 2)
{
int tmp = gao(i);
if(tmp > ans)
ans = tmp, pos = i;
}
cout << pos << endl;
cout << ans << endl;
return 0;
}