游戏

CCF真题

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<climits>
#include<cstdbool>
#include<cmath>
#include<algorithm>
using namespace std;
bool LastK(int n,int k)
{
    if(n%10==k||n%k==0)
        return true;
    return false;
}
int main()
{
    int n,k;
    cin>>n>>k;
    vector<int>Jop(n);
    for(int i=0;i<n;i++)
        Jop[i]=i+1;
    int per=n;
    int cur=0;
    int num=1;
    while(per!=1)
    {
        //cout<<"编号为："<<Jop[cur]<<"报数："<<num<<endl;
        int flag=0;
        if(LastK(num,k))
        {
            per--;
            for(int i=cur;i<n-1;i++)
                Jop[i]=Jop[i+1];
            flag=1;
        }
        num=num+1;
        if(flag==0)
        cur=(cur+1)%per;
    }
    cout<<Jop[0];
    return 0;
}