A. Slime Combining
来源:互联网 发布:对网络语言的看法ppt 编辑:程序博客网 时间:2024/05/29 04:21
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.
The first line of the input will contain a single integer, n (1 ≤ n ≤ 100 000).
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.
1
1
2
2
3
2 1
8
4
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 2 1.
In the last sample, the steps look as follows:
- 1
- 2
- 2 1
- 3
- 3 1
- 3 2
- 3 2 1
- 4
解题说明:此题是一道模拟题,类似于手机游戏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;}
- A. Slime Combining
- Codeforces 618A Slime Combining
- Codeforces 618A - Slime Combining
- CodeForces 618A Slime Combining
- CodeForces 618A Slime Combining
- Codeforces 618 . A Slime Combining
- CodeForces 618 A. Slime Combining
- Wunder Fund Round 2016 A. Slime Combining
- CodeForces 618 A. Slime Combining(水~)
- CodeForces 618 A. Slime Combining【模拟】
- CodeForces 618A:Slime Combining【模拟】
- Codeforces 618A Slime Combining 【模拟】
- CodeForces 618A-Slime Combining【模拟】
- codeforces-618A-Slime Combining【位运算】
- 【CodeForces 618A】Slime Combining(水题)
- cf#Wunder Fund Round 2016 -A - Slime Combining-简单数学
- CodeForces - 618A Slime Combining (快速幂)
- CF618A - Slime Combining
- windows7系统的安装
- 蓝懿ios技术交流和心得分享 16.1.30
- linux下的I/O复用函数
- blast linux
- 初识RecyclerView
- A. Slime Combining
- Angular.js(出库增加)
- 微信支付
- Android 中Webview 自适应屏幕
- 关于Struts.xml文件中的配置(路径问题)
- Insert a node in a sorted linked list.
- BZOJ-2324 营救皮卡丘 最小费用可行流+拆下界+Floyd预处理
- jpa2
- 【POJ】1456 - Supermarket(并查集,好题)