CSP认证考试201712-B 游戏

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cctype>
#include <fstream>
#define INF 0x3f3f3f3f
#define EPS 1e-24
using namespace std;

typedef long long ll;
const ll Mod = 1e9 + 7;

int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);

int n,k;
while(cin>>n>>k){
queue<int> que;
for(int i=1;i<=n;i++)que.push(i);
int num = 1;
while(que.size()>1){
int tmp = que.front();
que.pop();
if(num%10 != k && num%k != 0){
que.push(tmp);
}
num++;
}
int ans = que.front();
cout<< ans <<endl;
}
return 0;
}