【杂题】 HDOJ 1299 Diophantus of Alexandria

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 40005
#define eps 1e-10
#define mod 998244353
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
typedef long long LL;
//typedef int LL;
using namespace std;
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(LL &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
// head

int p[maxn];
int gcd(int a, int b)
{
if(!b) return a;
else return gcd(b, a%b);

}
int main(void)
{
int _, tmp, ans, cnt, n, __;
while(scanf("%d", &_)!=EOF) {
__ = 0;
while(_--) {
scanf("%d", &n);
tmp = sqrt(n);
cnt = ans = 0;
for(int i = 1; i <= tmp; i++) {
if(n%i == 0) {
p[cnt++] = i;
if(i != n/i) p[cnt++] = n/i;
}
}
for(int i = 0; i < cnt; i++)
for(int j = i; j < cnt; j++)
if(gcd(p[i], p[j]) == 1) ans++;
printf("Scenario #%d:\n", ++__);
printf("%d\n", ans);
printf("\n");
}
}
return 0;
}