#c++#沃瑟夫问题，还是会出错，请专家解答

Question

#include <bits/stdc++.h>
using namespace std;

const int size = 5001;
int n, m, q[size + 1], front = 1, rear = size;

int main() {

    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        rear = rear % size + 1;
        q[rear] = i;
    }
    int x = 0, i = 1, psum;
    while (rear % size + 1 != front) {
        psum = n - i + 1;
        x++;
        int y = q[front];
        front = front % size + 1;
        m = (i * i) % psum;
        if (!m) {
            printf("%d ", q[rear]), i++;
            x = 0;
            rear --;
        } else if (x == m) {
            printf("%d ", y), i++;
            x = 0;
        } else
            rear = rear % size + 1, q[rear] = y;
    }
    return 0;
}

会出错，大家指正指正

Answer 1

你可以提交这个代码

 
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int a[n+1]={0};
    for(int i=1;i<=n;i++) a[i]=i; 
    int num=n;//num为剩余人数 
    int count=1;//count为当前要报的数字 
    int tmp=0;//tmp为当前该哪个位置报数了 
    int l=1;//l表示当前是第几轮 
    while(num!=0)    
    {
        tmp++;
        if(tmp>n) tmp=1;
        int val=pow(l,2);
        if(a[tmp]!=-1)
        {
            if(count==val)
            {
            cout<<a[tmp]<<" ";
            a[tmp]=-1;
            l++;
            num--; 
            count=0;
            }
            count++;
        }
        
        
    }
    return 0;
}