zoukankan      html  css  js  c++  java
  • Codeforces--618A--Slime CombiningCrawling(数学)

    

    Slime CombiningCrawling in process...

      Crawling failed Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    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

    Input
    1
    
    Output
    1
    
    Input
    2
    
    Output
    2
    
    Input
    3
    
    Output
    2 1
    
    Input
    8
    
    Output
    4
    

    Sample Output

    Case #1: 17 Case #2: 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:

    1. 1
    2. 2
    3. 2 1
    4. 3
    5. 3 1
    6. 3 2
    7. 3 2 1
    8. 4

    #include<cstdio>
    #include<cmath>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    int main()
    {
    	__int64 n;
    	while(scanf("%I64d",&n)!=EOF)
    	{
    		int num[1010],cnt=0;
    		memset(num,0,sizeof(num));
    		while(n)
    		{
    			for(int i=0;;i++)
    			{
    				int ans=pow(2,i);
    				if(pow(2,i+1)>n&&ans<=n)
    				{
    					num[cnt++]=i+1;
    					n-=pow(2,i);
    					break;
    				}
    			}
    		}
    		for(int i=0;i<cnt-1;i++)
    		printf("%d ",num[i]);
    		printf("%d
    ",num[cnt-1]);
    	}
    	return 0;
    }
    

  • 相关阅读:
    Collection 和 Collections的区别?
    事务是什么?有哪些属性,并简要说明这些属性的含义。
    jsp有哪些内置对象?作用分别是什么?(至少三个)
    谈谈对XML的理解?说明Web应用中Web.xml文件的作用?
    类有哪三个基本特性?各特性的优点?
    Oracle安装完成后,如何用命令行启动和关闭数据库?
    请说明SQLServer中delete from tablea & truncate table tablea的区别
    试述数据库完整保护的主要任务和措施。
    存储过程和函数的区别
    性能
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273393.html
Copyright © 2011-2022 走看看