2014年10月5日
uval 6657 GCD XOR
摘要： GCD XORGiven an integer N, nd how many pairs (A; B) are there such that: gcd(A; B) = A xor B where1  B  A  N.Here gcd(A; B) means the greatest com... 阅读全文
posted @ 2014-10-05 22:42 一个大叔 阅读(161) 评论(0) 推荐(0)
zoj 3659 Conquer a New Region The 2012 ACM-ICPC Asia Changchun Regional Contest
摘要： Conquer a New RegionTime Limit:5 Seconds Memory Limit:32768 KBThe wheel of the history rolling forward, our king conquered a new region in a distant c... 阅读全文
posted @ 2014-10-05 20:25 一个大叔 阅读(167) 评论(0) 推荐(0)