循环队列（Joseplus Problem）

#include <iostream>
#include <stdio.h>

using namespace std;

int Q[];
int Head, Tail, Number_of_Items = ;

void Enqueue(int x)
{
    if( Number_of_Items ==  )
    {
        Head = Tail = ;
        Q[] = x;
    }
    else
    {
        Tail = (Tail + ) % ;//循环
        Q[Tail] = x;
    }
    Number_of_Items++;
}

int Dequeue()
{
    int z;

    z = Q[Head];
    Head = (Head + ) % ;
    Number_of_Items--;

    return z;
}

int main()
{
    int n;
    int i,j;
    int answer;

    printf("Enter an integer (1--99): ");
    scanf("%d", &n);

    /* Solve Joseplus Problem */
    /* Step 1: Put all the numbers beween 1 and n to the Queue */
    for(i = ; i <= n; i++)
        Enqueue(i);

    /* Step 2: Start killing for n-1 rounds */
    for(i = ; i <= n-; i++)
    {
        j = Dequeue();
        Dequeue();
        Enqueue(j);
    }

    answer = Q[Head];

    printf("The value of J(%d) is: %d\n", n, answer);
    return ;
}