303067: CF598A. Tricky Sum
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:1
Solved:0
Description
Tricky Sum
题意翻译
简明题意: 该题目有多组数据,每组数据给出一个n,让你求出从1到n的和,但是其中每当遇到一个数是2的次幂时,就要变加为减。例如输入n=4,那么计算算式为-1-2+3-4=-4,因为1是2^0,2是2^1,4是2^2。共有t组数据。题目描述
In this problem you are to calculate the sum of all integers from $ 1 $ to $ n $ , but you should take all powers of two with minus in the sum. For example, for $ n=4 $ the sum is equal to $ -1-2+3-4=-4 $ , because $ 1 $ , $ 2 $ and $ 4 $ are $ 2^{0} $ , $ 2^{1} $ and $ 2^{2} $ respectively. Calculate the answer for $ t $ values of $ n $ .输入输出格式
输入格式
The first line of the input contains a single integer $ t $ ( $ 1<=t<=100 $ ) — the number of values of $ n $ to be processed. Each of next $ t $ lines contains a single integer $ n $ ( $ 1<=n<=10^{9} $ ).
输出格式
Print the requested sum for each of $ t $ integers $ n $ given in the input.
输入输出样例
输入样例 #1
2
4
1000000000
输出样例 #1
-4
499999998352516354