codeforces Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) A Slime Combining(栈)
2016-01-30 12:42
344 查看
A. Slime Combining
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 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:
1
2
2 1
3
3 1
3 2
3 2 1
4
#include<cstdio> #include<cstring> #include<map> #include<stack> #include<iostream> #include<algorithm> using namespace std; struct Stack { int a[100005]; int top; }; Stack S; int main() { int n; scanf("%d",&n); S.a[S.top]=1; S.top++; for(int i=1;i<n;i++) { S.a[S.top]=1; while(S.a[S.top]==S.a[S.top-1])S.a[S.top-1]+=1,S.top--; S.top++; } for(int i=0;i<S.top;i++) printf("%d ",S.a[i]); return 0; }
相关文章推荐
- PHP和Web页面交互(二)
- git的使用—安装和初始化
- scikit-learn入门到精通(五)Unsupervised learning: seeking representations of the data
- SELinux: 为binderservice编写policy
- Bulls and Cows leetcode
- HDOJ 2846 Repository (字典树变形)
- 简单使用SQL Server中的Trace Flags
- [LeetCode]Pascal's Triangle II
- phpstorm使用技巧
- Android中自定义RatingBar(评分控件)的方法
- 引用
- 孵化 Docker 的 PaaS 平台 DotCloud 即将关闭
- NameNode启动过程详细剖析
- poj 2242 The Circumference of the Circle
- Asp.net生成静态网页的实现代码
- BZOJ 1024 SCOI2009 生日快乐 暴力搜索
- android录音 MediaRecorder类的使用简介
- HDOJ 1042 N!
- 动态内存分配
- 线程知识