A. Slime Combining
2016-01-30 18:33
405 查看
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Your friend recently gave you some slimes for your birthday. You have n slimes all initially with value 1.
You are going to play a game with these slimes. Initially, you put a single slime by itself in a row. Then, you will add the other n - 1 slimes
one by one. When you add a slime, you place it at the right of all already placed slimes. Then, while the last two slimes in the row have the same value v,
you combine them together to create a slime with value v + 1.
You would like to see what the final state of the row is after you've added all n slimes. Please print the values of the slimes in
the row from left to right.
Input
The first line of the input will contain a single integer, n (1 ≤ n ≤ 100 000).
Output
Output a single line with k integers, where k is
the number of slimes in the row after you've finished the procedure described in the problem statement. The i-th of these numbers
should be the value of the i-th slime from the left.
Sample test(s)
input
output
input
output
input
output
input
output
Note
In the first sample, we only have a single slime with value 1. The final state of the board is just a single slime with value1.
In the second sample, we perform the following steps:
Initially we place a single slime in a row by itself. Thus, row is initially 1.
Then, we will add another slime. The row is now 1 1. Since two rightmost slimes have the same values, we should replace these slimes with one with value 2.
Thus, the final state of the board is 2.
In the third sample, after adding the first two slimes, our row is 2. After adding one more slime, the row becomes 21.
In the last sample, the steps look as follows:
122 13
3 13 23 2 14
解题说明:此题是一道模拟题,类似于手机游戏2048,通过循环遍历不断对数字进行扩大即可。
#include<cstdio>
#include <cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n, cvp = 1, x = 0;
scanf("%d",&n);
while(n)
{
cvp = 1;
x = 0;
while(cvp<=n)
{
cvp*=2;
x++;
}
cvp/=2;
x--;
printf("%d ",x+1);
n-=cvp;
}
return 0;
}
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Your friend recently gave you some slimes for your birthday. You have n slimes all initially with value 1.
You are going to play a game with these slimes. Initially, you put a single slime by itself in a row. Then, you will add the other n - 1 slimes
one by one. When you add a slime, you place it at the right of all already placed slimes. Then, while the last two slimes in the row have the same value v,
you combine them together to create a slime with value v + 1.
You would like to see what the final state of the row is after you've added all n slimes. Please print the values of the slimes in
the row from left to right.
Input
The first line of the input will contain a single integer, n (1 ≤ n ≤ 100 000).
Output
Output a single line with k integers, where k is
the number of slimes in the row after you've finished the procedure described in the problem statement. The i-th of these numbers
should be the value of the i-th slime from the left.
Sample test(s)
input
1
output
1
input
2
output
2
input
3
output
2 1
input
8
output
4
Note
In the first sample, we only have a single slime with value 1. The final state of the board is just a single slime with value1.
In the second sample, we perform the following steps:
Initially we place a single slime in a row by itself. Thus, row is initially 1.
Then, we will add another slime. The row is now 1 1. Since two rightmost slimes have the same values, we should replace these slimes with one with value 2.
Thus, the final state of the board is 2.
In the third sample, after adding the first two slimes, our row is 2. After adding one more slime, the row becomes 21.
In the last sample, the steps look as follows:
122 13
3 13 23 2 14
解题说明:此题是一道模拟题,类似于手机游戏2048,通过循环遍历不断对数字进行扩大即可。
#include<cstdio>
#include <cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n, cvp = 1, x = 0;
scanf("%d",&n);
while(n)
{
cvp = 1;
x = 0;
while(cvp<=n)
{
cvp*=2;
x++;
}
cvp/=2;
x--;
printf("%d ",x+1);
n-=cvp;
}
return 0;
}
相关文章推荐
- Android 中Webview 自适应屏幕
- 初识RecyclerView
- linux下的I/O复用函数
- 初识RecyclerView
- Angular.js(出库增加)
- 微信支付
- windows7系统的安装
- Apache DbUtils 教程
- poj2492 A Bug's Life(并查集)
- UVA1625Color Lenth(DP+LCS变形 未AC)
- 用友NC V6.3打造集团企业高效信息平台
- 1036. 跟奥巴马一起编程(15)
- Format可能存在的坑
- 反馈通道改善系统性能_20160130
- 从Spark架构中透视job
- ubuntu 的 document viewer evince 发生 Could not open X display 错误的处理
- 【转】一个测试工程师的2015总结和2016年小展望
- LNMP安装与启动脚本编写
- 数字证书原理
- 【转】移动App测试中的最佳做法