【CodeForces
来源:互联网 发布:js 直接写 和 onload 编辑:程序博客网 时间:2024/06/16 01:33
点击打开链接
Tricky Sum
In this problem you are to calculate the sum of all integers from 1to 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, because1, 2 and 4 are 20, 21 and 22 respectively.
Calculate the answer for t values of n.
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).
Print the requested sum for each of t integers n given in the input.
241000000000
-4499999998352516354
The answer for the first sample is explained in the statement.
// 有些编译器不接受long long 所以用_int64 或头文件改成C++
//代码如下:
#include <cstdio>int main(){ long long int sum,mul,ans,k; long long int n; int t; scanf ("%d",&t); while(t--) { ans = 1; mul = 1; k = 1; scanf ("%lld",&n); sum = n * (n+1) / 2; while (k <= n) { k*=2; ans++; }// for (long long i = 1 ; i <= ans ; i++)// {// mul *= 2;// } k = k - 1; sum = sum - 2*k; printf ("%lld\n",sum); }return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- ECMAScript 2017(ES8)特性概述
- 简单实现自己的类似UniversalImageLoader网络图片加载缓存框架
- POJ2251 Dungeon Master kuangbin-搜索入门-B
- sizeof的一些用法(给自己看的)
- 快速幂+求值
- 【CodeForces
- python爬虫上手 笔记<1>
- JS计时器
- 一个整型数组里除了两个数字之外,其他的数字都出现了两次。请写程序找出这两个只出现一次的数字。
- C语言字符串操作函数
- 深入理解simhash原理
- junit学习之junit的基本介绍
- 高可用集群之keepalived
- CSS3实现文字阴影与自动换行