CodeForces 598A--Tricky Sum
来源:互联网 发布:怎么看淘宝访客数据 编辑:程序博客网 时间:2024/05/16 07:00
B - Tricky Sum
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescription
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 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.
Sample Input
Input
241000000000
Output
-4499999998352516354
题目大意:
给你一个序列:-1,-2,3,-4......n观察这个序列的特点,求出这个序列的和。
AC代码:
#include<stdio.h>#include<math.h>#include<algorithm>using namespace std;int main(){int T;scanf("%d",&T);while(T--){__int64 n;scanf("%I64d",&n);__int64 sum=0,sum2,temp=1,m=1;sum=n*(n+1)/2;while(temp<=n){temp*=2;m++;}sum2=-pow(2,m-1)+1;printf("%I64d\n",sum+sum2*2);}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(思维)
- POJ 1321 DFS
- 多线程 : 使用 Future 获取线程返回结果
- 利用UIImageJPEGRepresentation与UIGraphicsBeginImageContext进行图片压缩的简单比较
- 读书笔记(1)
- mycncart 1.4.0.0 新版本发布
- CodeForces 598A--Tricky Sum
- Java中基于TCP的Socket通信
- HDU 2973 YAPTCHA [威尔逊定理]
- Statement、PreparedStatement和callableStatement的异同
- 文章标题
- HDU 1257:最少拦截系统
- epoll模型的EPOLLLT模式和EPOLLET模式比较
- 决策树个人理解
- 详解spring mvc 3.0常用注解