约瑟夫循环问题

不知道用vector储存新队列为啥会错，

核心代码

			for(int i=1; i<=p;) {
				temp=temp>=n?1:(temp+1);
				if(vis[sav1[temp]]) continue;
				i++;//重要
			}
			vis[sav1[temp]]=sen++;
			sav2[cnt++]=sav1[temp];
			ans--;
		}

source

//#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <queue>
#include <vector>
#include <iterator>
#include <map>
#include <bitset>
#include <stack>
#include <deque>
#include <cmath>
#include <iomanip>
#include <forward_list>
#include <set>
#include <cmath>
#include <cctype>
#include <sstream>
#include <climits>
#include <list>
#include <typeinfo>
//INT_MAX 32 bit int
//LLONG_MAX 64 bit int
//LONG_MAX 64 bit int

using namespace std;

//#pragma comment(linker, "/STACK:3073741824")
#define memmin(a) memset(a,0,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a));
#define spr(n) fixed << setprecision(n)
#define endll '\n'
#define ifor(i, l, r) for (long long (i) = (l); (i) <= (r); ++(i))
#define rfor(i, r, l) for (long long (i) = (r); (i) >= (l); --(i))
#define fori(i,l,r) for(auto i=p;i!=p1;++i)
#define rfori(i,rl,rr) for(auto i=rl;i!=rr;++i)
#define coute cout<<'\n'
typedef long long ll;
typedef pair<int, int> P;
typedef unsigned long long ull;

template <class T, class Container = vector<T>,
          class Compare = less<typename Container::value_type> >
using priqueue = priority_queue<T,Container,Compare>;

#define start1
#ifndef start1
const int IINF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1.0e-9;
const long long MOD = 1e9 + 7;
const int MAX1 = 1e5 + 100;
const int MAX2 = 1e7 + 100;

#endif

#define start2
#ifndef start2

//__int128读取
void  read(ll& w) {
	w=0;
	ll f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') {
		w = w * 10 + ch - '0';
		ch = getchar();
	}
}

void print128(ll x) {
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	if (x > 9)print128(x / 10);
	putchar(x % 10 + '0');
}

#endif

#define start
#ifndef start3
template<typename container>
void _print(container &a2) {
	for (auto i = a2.begin(); i != a2.end(); i++) {
		if (i == a2.begin()) cout << *i;
		else
			cout << " " << *i;
	}
}

template<typename T1>
auto _print(T1 a1, ll l, ll r) ->void {
	for (ll i = l; i <= r; ++i) {
		if (i == l) cout << a1[i];
		else cout << " " << a1[i];
	}
}
#endif
queue<int > my;

int vis[5000];
//vector<int >sav1(5000);
//vector<int> sav2(5000);
int sav1[5000];
int sav2[5000];
void solved() {
	int n,p;
	cin>>n;
	ifor(i,1,n) {
		sav1[i]=i;
	}
	while(cin>>p) {
		int ans=n;
		int temp=0;
		int sen=1;
		int cnt=1;
//		ifor(i,1,n) {
//			cout<<"   "<<sav1[i];
//		}
//		cout<<endl;
		while(ans) {
			for(int i=1; i<=p;) {
				temp=temp>=n?1:(temp+1);
				if(vis[sav1[temp]]) continue;
				i++;
			}
			vis[sav1[temp]]=sen++;
			sav2[cnt++]=sav1[temp];
			ans--;
		}
//		ifor(i,1,n) {
//			cout<<"   "<<sav2[i];
//		}
//		cout<<endl;
		ifor(i,1,n) {
			sav1[i]=sav2[i];
		}
		memmin(vis);
	}
	ifor(i,1,n) {
		printf("%4d",sav1[i]);
	}
	cout<<endl;

}
int main(int argv,char** argc) {
	//	ios::sync_with_stdio(false);
	//	cin.tie(0);
	//	cout.tie(0);
	solved();
	return 0;
}