uva 11384 正整数序列
2017-01-10 00:41
288 查看
Dexter is tired of Dee Dee. So he decided to keep Dee Dee busy in a game. The game he planned for
her is quite easy to play but not easy to win at least not for Dee Dee. But Dexter does not have time
to spend on this silly task, so he wants your help.
There will be a button, when it will be pushed a random number N will be chosen by computer.
Then on screen there will be numbers from 1 to N. Dee Dee can choose any number of numbers from
the numbers on the screen, and then she will command computer to subtract a positive number chosen
by her (not necessarily on screen) from the selected numbers. Her objective will be to make all the
numbers 0.
For example if N = 3, then on screen there will be 3 numbers on screen: 1, 2, 3. Say she now selects
1 and 2. Commands to subtract 1, then the numbers on the screen will be: 0, 1, 3. Then she selects 1
and 3 and commands to subtract 1. Now the numbers are 0, 0, 2. Now she subtracts 2 from 2 and all
the numbers become 0.
Dexter is not so dumb to understand that this can be done very easily, so to make a twist he will
give a limit L for each N and surely L will be as minimum as possible so that it is still possible to win
within L moves. But Dexter does not have time to think how to determine L for each N, so he asks
you to write a code which will take N as input and give L as output.
Input
Input consists of several lines each with N such that 1 ≤ N ≤ 1, 000, 000, 000. Input will be terminated
by end of file.
Output
For each N output L in separate lines.
Sample Input
1
2
3
Sample Output
1
2
2
题目大意为给定一个序列 1到n ,用最少的操作次数把序列所有数都变成0
每次操作从序列中选取一个或者多个数,同时减去一个整数。
输出最少操作次数。
简单的数学问题。
一种类似与折半的处理方法
比如 1 2 3 4 5 6 变成 1 2 3 0 1 2 这个序列 等价于1 2 3
再比如说 1 2 3 4 5 6 7 8 变成 1 2 3 4 0 1 2 3 等价于 1 2 3 4
1 2 3 4 变成 1 2 0 1 等价于1 2
1 2 编程 1 0 等价于 1
然后 找下规律
代码太简单不想打
her is quite easy to play but not easy to win at least not for Dee Dee. But Dexter does not have time
to spend on this silly task, so he wants your help.
There will be a button, when it will be pushed a random number N will be chosen by computer.
Then on screen there will be numbers from 1 to N. Dee Dee can choose any number of numbers from
the numbers on the screen, and then she will command computer to subtract a positive number chosen
by her (not necessarily on screen) from the selected numbers. Her objective will be to make all the
numbers 0.
For example if N = 3, then on screen there will be 3 numbers on screen: 1, 2, 3. Say she now selects
1 and 2. Commands to subtract 1, then the numbers on the screen will be: 0, 1, 3. Then she selects 1
and 3 and commands to subtract 1. Now the numbers are 0, 0, 2. Now she subtracts 2 from 2 and all
the numbers become 0.
Dexter is not so dumb to understand that this can be done very easily, so to make a twist he will
give a limit L for each N and surely L will be as minimum as possible so that it is still possible to win
within L moves. But Dexter does not have time to think how to determine L for each N, so he asks
you to write a code which will take N as input and give L as output.
Input
Input consists of several lines each with N such that 1 ≤ N ≤ 1, 000, 000, 000. Input will be terminated
by end of file.
Output
For each N output L in separate lines.
Sample Input
1
2
3
Sample Output
1
2
2
题目大意为给定一个序列 1到n ,用最少的操作次数把序列所有数都变成0
每次操作从序列中选取一个或者多个数,同时减去一个整数。
输出最少操作次数。
简单的数学问题。
一种类似与折半的处理方法
比如 1 2 3 4 5 6 变成 1 2 3 0 1 2 这个序列 等价于1 2 3
再比如说 1 2 3 4 5 6 7 8 变成 1 2 3 4 0 1 2 3 等价于 1 2 3 4
1 2 3 4 变成 1 2 0 1 等价于1 2
1 2 编程 1 0 等价于 1
然后 找下规律
代码太简单不想打
相关文章推荐
- 大水题(正整数序列,uva 11384)
- 第一章例题10正整数序列UVa 11384(找规律)
- 正整数序列-UVA 11384 - Help is needed for Dexter
- Uva 11384 正整数序列
- 正整数序列 (Help is needed for Dexter, UVa 11384)
- 【巧妙算法系列】【UVA 11384】 Help is needed for Dexter 正整数序列
- 【巧妙算法系列】【UVA 11384】 Help is needed for Dexter 正整数序列
- uva 11384 正整数序列( Help is needed for Dexter)
- UVA11384 - Help is needed for Dexte(正整数序列)
- UVa 11384 Help is needed for Dexter 正整数序列
- UVa 11384 Help is needed for Dexter 正整数序列
- UVA11384正整数序列(把123..变成0的最小步数)
- UVa 11384 - Help is needed for Dexter (正整数序列)
- UVa 11384 - Help is needed for Dexter (正整数序列)
- 正整数排序 Help is need for Dexter Uva 11384
- 判断整数序列是不是二元查找树的后序遍历结果
- 面试100题:9.判断整数序列是不是二元查找树的后序遍历结果
- 求一组整数数组中的连续子序列和的最大值
- 5-29 求整数序列中出现次数最多的数 (15分)
- 一个整数数组(正负,0),找出这个数组的最大子序列