Uva12716:GCD XOR
Given an integer N, find how many pairs (A, B) are there such that: gcd(A, B) = A xor B where
1 ≤ B ≤ A ≤ N.
Here gcd(A, B) means the greatest common divisor of the numbers A and B. And A xor B is th
原创
2015-08-23 16:37:25 ·
512 阅读 ·
0 评论