//UVA12716GCD XOR
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int M = 30000000;
int sum[M + 2], cnt[M + 2];
inline int Gcd(int a, int b) {
return b == 0 ? a : Gcd(b, a % b);
}
void Init() {
for(int c = 1; c <= M; c++) {
for(int a = c * 2; a <= M; a += c) {
int b = a - c;//题中条件成立的必要不充分条件
if(c == (a ^ b) /*&& c == Gcd(a, b)根据b=a-c的关系,此式子无需验证*/) cnt[a]++;//算出存在数字a时的符合的(a, b)的数量
}
}
sum[0] = 0;
for(int i = 1; i <= M; i++) sum[i] = sum[i - 1] + cnt[i];
}
int main() {
int n, T, kase = 0;
Init();
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
printf("Case %d: %d\n", ++kase, sum[n]);
}
return 0;
}
/*
2
7
20000000
*/
UVA12716GCD XOR
最新推荐文章于 2018-02-22 21:20:53 发布