|
||||||||||
Exclusive orTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1023 Accepted Submission(s): 370 Problem Description Given n, find the value of Note: ¨’ denotes bitwise exclusive-or. Input The input consists of several tests. For each tests: A single integer n (2ˇÜn<10500). Output For each tests: A single integer, the value of the sum. Sample Input
Sample Output
Author Xiaoxu Guo (ftiasch) Source | ||||||||||
|