UVA12716 GCD等于XOR GCD XOR

UVA12716 GCD等于XOR GCD XOR

TITLE

思路

$\because \gcd (i,j)\le i-j\le i\oplus j$
$\because \gcd (i,j)=i\oplus j$
$\therefore \gcd (i,j)=i-j=i\oplus j$
$\gcd (i,j)=\gcd (i,i-j)=i-j$
$\therefore i-j|i$
枚举$j，i\ge j\ast 2,j|i$
若$i\oplus j=i-j,ans[j]+1$
$an{s}_i放的是i的答案$
$an{s}_i=an{s}_i+an{s}_{i-1},i\ge 2$
$前缀和，an{s}_i是1至i的答案$

CODE

#include<iostream> 
#include<cstdio>
using namespace std;
const int maxn=30000000,half=15000000;
int ans[maxn+10];
int main()
{
	int n,x;
	for(int i=1;i<=half;++i)
		for(int j=i<<1;j<=maxn;j+=i)
			if((i^j)==j-i)++ans[j];
	for(int i=2;i<=maxn;++i)ans[i]+=ans[i-1];
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
		scanf("%d",&x),printf("Case %d: %d\n",i,ans[x]);
	return 0;
}