2018年8月6日
#题目：GCD XOR UVA - 12716
摘要： 题目描述 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 co 阅读全文
posted @ 2018-08-06 11:01 IAMjm 阅读(233) 评论(0) 推荐(0) 编辑