CodeForces 618A:Slime Combining【模拟】
2016-03-12 17:51
399 查看
Slime Combining
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
618A
Description
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 - 1slimes 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 Input
Input
Output
Input
Output
Input
Output
Input
Output
Hint
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 value 1.
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 2 1.
In the last sample, the steps look as follows:
122 133 13 23 2 14AC-code:
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice CodeForces
618A
Description
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 - 1slimes 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 Input
Input
1
Output
1
Input
2
Output
2
Input
3
Output
2 1
Input
8
Output
4
Hint
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 value 1.
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 2 1.
In the last sample, the steps look as follows:
122 133 13 23 2 14AC-code:
#include<cstdio> #include<cstring> using namespace std; int main() { int n,i,j,sum,s[100005]; scanf("%d",&n); memset(s,0,sizeof(s)); sum=0; for(i=1,j=0;i<=n;i++,j++) { s[j]++; for(;j>=1;j--) { if(s[j]==s[j-1]) { s[j-1]++; s[j]=0; } else break; } } printf("%d",s[0]); if(j==0) { printf("\n"); } else { for(i=1;s[i]!=0;i++) printf(" %d",s[i]); printf("\n"); } return 0; }
相关文章推荐
- Visual Studio 2012开发SQL Server 2012商业智能项目
- 新浪微博爬虫模拟登录(爬手机版)
- AdaBoost
- Uoj #131. 【NOI2015】品酒大会 后缀数组,并查集
- 现代软件工程第二周作业
- css中的display
- 四则运算2
- 第二周总结
- sublime text3自定义快捷键
- 计数排序c++实现
- python urllib
- CodeForce 377 A mazes (逆向思维)
- 原型继承名词解释
- 四则运算2及PSP0设计项目计划
- 第三周项目3-输出星号图(e)
- Linus,一生只为寻找欢笑
- angular 语法笔记
- Design库,全部控件的使用
- 代码健壮性--异常处理中try catch finall throw throws五个关键字学习
- Bias and Variance