CodeForces 598A Tricky Sum
来源:互联网 发布:markmonitor 注册域名 编辑:程序博客网 时间:2024/04/29 10:53
Tricky Sum
time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputIn 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 20, 21 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.
Examples
input
241000000000
output
-4499999998352516354
Note
The answer for the first sample is explained in the statement.
#include<stdio.h>#include<math.h>int main(){int t,i;long long n,ans;scanf("%d",&t);while(t--){scanf("%lld",&n);ans=n*(n+1)/2;for(i=0;pow(2,i)<=n;i++){ans=ans-(2*pow(2,i));}printf("%lld\n",ans);}return 0;}
0 0
- CodeForces 598A--Tricky Sum
- CodeForces 598A- Tricky Sum
- 【CodeForces】[598A]Tricky Sum
- CodeForces 598A Tricky Sum
- codeforces 598A Tricky Sum
- 【Codeforces 598A】 Tricky Sum
- CodeForces 598A Tricky Sum
- CodeForces 598A Tricky Sum
- 【CodeForces 598A Tricky Sum】
- CodeForces 598A Tricky Sum
- CodeForces 598A Tricky Sum
- codeforces 598A Tricky Sum
- A. Tricky Sum CodeForces 598A
- Codeforces 598A Tricky Sum 【计数】
- Codeforces--598A--Tricky Sum(数学)
- CodeForces 598 A Tricky Sum【数学】
- CodeForces 598A:Tricky Sum【数学】
- CodeForces 598A Tricky Sum(思维)
- 温湿度传感器SHT20的驱动与使用
- hibernate-sql
- Error:(710) Apostrophe not preceded by \ (in )
- BZOJ 2002 分块
- jqery身份证有效验证
- CodeForces 598A Tricky Sum
- 采用opencv计算外接矩形
- Javaweb与Tomcat服务器
- 自定义GridView 实现加载头布局
- JZOJ4720. 地下的太阳
- 浅谈工作中如何规避思维定式
- 浙大PAT甲级 1054
- CodeForces 597A Divisibility
- List对象排序