zoukankan      html  css  js  c++  java
  • codeforces Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) A Slime Combining(栈)

    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. 1
    2. 2
    3. 2 1
    4. 3
    5. 3 1
    6. 3 2
    7. 3 2 1
    8. 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;
    }
  • 相关阅读:
    android ImageSwitcher
    andriod Spinner
    andriod RadioButton
    anriod TabHost
    给大学生的几条良心建议
    6月最新地铁站周边二手房价格出炉
    机器学习 101 Mahout 简介 建立一个推荐引擎 使用 Mahout 实现集群 使用 Mahout 实现内容分类 结束语 下载资源
    Vim设置colorscheme小技巧
    2017年阳光私募基金一季度报告
    实用的 atom 插件
  • 原文地址:https://www.cnblogs.com/homura/p/5170863.html
Copyright © 2011-2022 走看看