机试真题 小朋友报数问题——约瑟夫环

#include<iostream>
#include<vector>
#include<queue>
#include<string>
using namespace std;

int n, k;

struct node {
	int index = -1;
	int num = -1;
};

queue<node>que;
vector<node>vec;

bool charge(int m) {
	if (m%k == 0)
		return true;
	string sm = to_string(m);
	string sk = to_string(k);
	if (sm.size() < sk.size())
		return false;
	if (sm.find(sk,sm.size()-sk.size()) != string::npos)
		return true;
	else
		return false;
}

int main() {
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		node n;
		n.index = i;
		n.num = i;
		if (charge(i)) {
			vec.push_back(n);
		}
		else {
			que.push(n);
		}
	}
	int cnt = n + 1;
	while (!que.empty()) {
		//对队列内进行循环计数；
		node n = que.front();
		que.pop();
		n.num = cnt++;
		if (charge(n.num)) {
			vec.push_back(n);
		}
		else {
			que.push(n);
		}
	}
	for (auto ele : vec) {
		cout << ele.index << " " << ele.num << endl;
	}
}