B. Construct a simple sequence (greedy)

B.Construct a simple sequence of numbers(贪心)

Whether each judgment satisfies the mutual prime,Not satisfied to join the candidate queue,Then when one is satisfied, add the queue to the back.

#include<bits/stdc++.h>

using namespace std;

int a[1000005];

int main(){
    
	int n;
	cin>>n;
	while(n--){
    
		int x,y;
		cin>>x>>y;
		a[1]=x;
		int cnt=1;
		queue<int>q;
		for(int i=1;cnt<=y;i++){
    
			if(i==x)continue;
			if(__gcd(a[cnt],i)==1){
    
				a[++cnt]=i;
				while(!q.empty()){
    
					a[++cnt]=q.front();
					q.pop();
				}
			}
			else{
    
				q.push(i);
			}
		}
		cout<<a[y]<<"\n";
	}
	return 0;
}