zoukankan      html  css  js  c++  java
  • Uva 10935 Throwing cards away I

    Problem B: Throwing cards away I

    Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck:

    Throw away the top card and move the card that is now on the top of the deck to the bottom of the deck.

    Your task is to find the sequence of discarded cards and the last, remaining card.

    Each line of input (except the last) contains a number n ≤ 50. The last line contains 0 and this line should not be processed. For each number from the input produce two lines of output. The first line presents the sequence of discarded cards, the second line reports the last remaining card. No line will have leading or trailing spaces. See the sample for the expected format.

    Sample input

    7
    19
    10
    6
    0
    

    Output for sample input

    Discarded cards: 1, 3, 5, 7, 4, 2
    Remaining card: 6
    Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14
    Remaining card: 6
    Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8
    Remaining card: 4
    Discarded cards: 1, 3, 5, 2, 6
    Remaining card: 4
    
    
    
    
    
    
    不得不说,此题过水。。。
    唯一需要注意的是输入1时候,后面不能有空格,可以用文件测出来
    
    
    #include <bits/stdc++.h>
    using namespace std;
    
    int main()
    {
    #ifndef ONLINE_JUDGE
            freopen("in.txt","r",stdin);
            freopen("out.txt","w",stdout);
    #endif
    
        int n;
        while(cin >> n, n!=0)
        {
            list<int> lst;
            vector<int> discard;
    
            for(int i = 1; i<= n; i++)
                lst.push_back(i);
    
            while(lst.size()>=2)
            {
                discard.push_back(lst.front());
                lst.pop_front();
                int temp = lst.front();
                lst.pop_front();
                lst.push_back(temp);
            }
    
            cout << "Discarded cards:";
            bool flag = false;
            for(auto i : discard)
            {
                if(flag == false)
                {
                    cout << " " << i ;
                    flag = true;
                }
                else
                    cout << ", " << i ;
            }
            cout << endl;
            cout << "Remaining card: " << lst.front() << endl;
        }
        return 0;
    }
    


  • 相关阅读:
    left join 多表关联查询
    Dictionary解析json,里面的数组放进list,并绑定到DataGridView指定列
    C#同一位置切换显示两个Panel内容
    C#点击按钮用DataGridView动态增加行、删除行,增加按钮列
    C#获取本机mac地址
    C# MD5加密
    C# SQLiteDataReader获得数据库指定字段的值
    linux下mongodb安装、服务器、客户端、备份、账户命令
    ubuntu下创建python的虚拟环境
    python多进程之间的通信:消息队列Queue
  • 原文地址:https://www.cnblogs.com/kunsoft/p/5312796.html
Copyright © 2011-2022 走看看