【codeforces】数学

A - A 使用long long
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.


#include<cstdio>
#include<cmath>
#include<algorithm>
#define LL long long
using  namespace std;
LL a[50];
void init(){
	for(int i=0;i<=32;i++){
		a[i]=pow(2,i);
	}
}
int main(){
	LL n,t;
	scanf("%lld",&t);
	init();
	while(t--){
		LL sum,num=0;
		scanf("%lld",&n);
		sum=n*(n+1)/2;                  //等差数列
	//	printf("%lld--\n",sum);
		for(int l=0;l<=32&&a[l]<=n;l++){
			num=num+a[l];
		}
		printf("%lld\n",sum-num*2);
	}
	return 0;
}






评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值