CodeForces - 618A Slime Combining (快速幂)
来源:互联网 发布:南京淘宝美工课程培训 编辑:程序博客网 时间:2024/05/15 20:43
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 - 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 Input
1
1
2
2
3
2 1
8
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 becomes2 1.
In the last sample, the steps look as follows:
- 1
- 2
- 2 1
- 3
- 3 1
- 3 2
- 3 2 1
- 4
Source
#include<stdio.h>#include<string.h>#include<algorithm>#define INF 0x3f3f3f3f#define ll long long#define N 10010#define M 1000000007#define PI acos(-1.0)using namespace std;int a[N];int kp(int n,int k){ll s=1;while(k){if(k&1)s*=n;n*=n;k/=2;}return s;}int main(){int i,j,k;int nn,n;while(scanf("%d",&nn)!=EOF){n=nn;int kk=0;while(n){int k=0;int m=kp(2,k);while(m<=n){k++;m=kp(2,k);}a[kk++]=k;n-=kp(2,k-1);}for(i=0;i<kk-1;i++)printf("%d ",a[i]);printf("%d\n",a[kk-1]);}return 0;}
- CodeForces - 618A 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
- Codeforces 618 . 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【位运算】
- A. Slime Combining
- Codeforces--618A--Slime CombiningCrawling(数学)
- codeforces Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) A.Slime Combining
- Wunder Fund Round 2016 A. Slime Combining
- XML以及XML解析方式[DOM+SAX]
- AngularJs的post传递参数action接不到
- VMware workstations Pro的三种联网方式
- java编程基础小结
- VC++ Excel电子表格读写示例
- CodeForces - 618A Slime Combining (快速幂)
- 【2016.3.12】wget解析
- 如何高效学习安卓
- c++第2次上机实验-1
- Java中字符串比较的一道面试题
- 游戏动作师使用Unity3D遇到过的所有问题
- Uva 11582 Colossal Fibonacci Numbers!
- Thinking in c++ exercise 4-26 关于二维数组指针
- 新学期,新开始,今日见吾系兰神立志学习ACM于此博客,感触颇深,遂立此博文,以记录笔记,激励思想,但求四年之学业不荒废矣