UVa10935 - Throwing cards away I

最新推荐文章于 2021-08-19 15:22:10 发布

原创最新推荐文章于 2021-08-19 15:22:10 发布 · 485 阅读

0 ·

CC 4.0 BY-SA版权

UVA 专栏收录该内容

232 篇文章

订阅专栏

本文探讨了使用队列和数组解决卡片问题的方法，对比了两种数据结构的实现方式，展示了如何通过循环操作从队列或数组中移除元素并保持问题的连续性。

两个一个队列的，一个数组，我认为用队列比较简单

#include<iostream>
#include<queue>
using namespace std;
queue<int> cards;
int n;
int main()
{
    while(cin>>n&&n){
        for(int i=1;i<=n;i++)
            cards.push(i);
        cout<<"Discarded cards:";
        int first=1;
        while(!cards.empty()){
            if(cards.size()==1)break;
            if(first) { first=0;cout<<" "; }
            else cout<<", ";
            cout<<cards.front();
            cards.pop();
            cards.push(cards.front());
            cards.pop();
        }
        cout<<endl;
        cout<<"Remaining card: "<<cards.front()<<endl;
        while(!cards.empty())
        cards.pop();
    }
    return 0;
}

#include<iostream>
#include<vector>
using namespace std;
int n;
vector<int> cards;
int main()
{
    while(cin>>n&&n){
        int first = 1;
        for(int i=1;i<=n;i++)
            cards.push_back(i);
        cout<<"Discarded cards:";
        while(cards.size() != 1){
            if(first) { first = 0; cout<<" "; }
            else cout<<", ";
            cout<<cards[0];
            cards.erase(cards.begin());
            cards.push_back(cards[0]);
            cards.erase(cards.begin());
        }
        cout<<endl;
        cout<<"Remaining card: "<<cards[0]<<"\n";
        cards.clear();
    }
    return 0;
}