关闭

CodeForces 598A Tricky Sum

231人阅读 评论(0) 收藏 举报
分类:
Q - Q
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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 12 and 4 are 2021 and 22 respectively.

Calculate the answer for t values of n.

Input

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 ≤ 109).

Output

Print the requested sum for each of t integers n given in the input.

Sample Input

Input
2
4
1000000000
Output
-4
499999998352516354

Hint

The answer for the first sample is explained in the statement.

没想到直接计算竟然AC了,本来以为会有什么技巧呢,真水。。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	__int64 t,i,n,sum;
	scanf("%I64d",&t);
	while(t--)
	{
		sum=0;
		scanf("%I64d",&n);
		sum=n*(n+1)/2;
		for(i=1;i<=n;i=i*2)
		{
			sum=sum-2*i;
		}
		printf("%I64d\n",sum);
	}
	return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:130679次
    • 积分:7945
    • 等级:
    • 排名:第2889名
    • 原创:694篇
    • 转载:2篇
    • 译文:0篇
    • 评论:15条
    最新评论