【CodeForces】[598A]Tricky Sum
2016-04-07 13:33
417 查看
挺水的一题
先公式求1~n的和
然后依次减去2的i次方
直到2的i次方大于n
#include<stdio.h> int main() { int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); __int64 res=(__int64)n*(__int64)(n+1)/2; int t=1; while(1) { res-=t*2; if(t>n/2) break; t*=2; } printf("%I64d\n",res); } return 0; }
题目地址:【CodeForces】[598A]Tricky Sum
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- codeforces 618C. Constellation
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- CodeForces 603A_Alternative Thinking (DP)
- CodeForces 602B_Approximating a Constant Range_DP
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query