HDU 5587 Array
2015-11-30 13:03
351 查看
Array
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 330 Accepted Submission(s): 163
Problem Description
Vicky is a magician who loves math. She has great power in copying and creating.
One day she gets an array {1}。 After that, every day she copies all the numbers in the arrays she has, and puts them into the tail of the array, with a signle '0' to separat.
Vicky wants to make difference. So every number which is made today (include the 0) will be plused by one.
Vicky wonders after 100 days, what is the sum of the first M numbers.
Input
There are multiple test cases.
First line contains a single integer T, means the number of test cases.(1≤T≤2∗103)
Next T line contains, each line contains one interger M. (1≤M≤1016)
Output
For each test case,output the answer in a line.
Sample Input
3
1
3
5
Sample Output
1
4
7
Source
BestCoder Round #64 (div.2)
一开始他拥有一个数列{1}。每过一天,他将他当天的数列复制一遍,放在数列尾,并在两个数列间用0隔开。Vicky想做些改变,于是他将当天新产生的所有数字(包括0)全加1。Vicky现在想考考你,经过100天后,这个数列的前M项和是多少?。
相关文章推荐
- JavaScript HTML DOM 元素(节点)
- Lintcode: Sqrt(X)
- Callback机制在Android中的应用场景
- mysql优化方案
- jsp中引入外部js文件时需要注意的关键点
- 数据结构基础7.6:表排序
- sql
- Android中使用Movie显示gif动态图
- 四个整数运算
- java之字符串
- 原型和实例的关系
- 分享自己的一些android util 源文件
- Linux文件系统详解
- Http协议中的方法
- smslib 短信猫开发,不解除端口占用
- C-005.printf函数介绍和占位符介绍
- HDU 5586
- C/C++与Matlab混合编程初探
- 虚拟机字节码执行引擎
- NJUPT 微机 中断系统 日时钟中断之替换1CH实现字符串动态显示