ACM学习历程—HDU5269 ZYB loves Xor I(位运算 && dfs && 排序)（BestCoder Round #44 1002题）
摘要：
Problem DescriptionMemphis loves xor very musch.Now he gets an array A.The length of A is n.Now he wants to know the sum of all (lowbit(Ai xor Aj) (i,... 阅读全文
posted @ 2015-06-13 21:40 AndyQsmart 阅读(398) 评论(0) 推荐(1)
浙公网安备 33010602011771号