11866 : 조세푸스 문제 (Queue) [C++]

#include <iostream>
#include <vector>

using namespace std;

class Queue
{
private:
 int* Array;
 int size;
 int Front;
 int Rear;
public:
 Queue(int _size);
 void Add(int num);
 int GetFront();
};

Queue::Queue(int _size)
{
 size = _size;
 Array = new int[size];
 Front = 0;
 Rear = 0;
}

void Queue::Add(int num)
{
 Array[Rear++] = num;
}

int Queue::GetFront()
{
 return Array[Front++];
}

int main()
{
 int Size;
 cin >> Size;

 int* iArray = new int[Size];
 bool* bArray = new bool[Size];

 Queue Q(Size);

 int Num;
 cin >> Num;

 for (int i = 0; i < Size; i++)
 {
  iArray[i] = i + 1;
  bArray[i] = true;
 }

 int X = 0;

 for (int i = 0; i < Size; i++)
 {
  int Count = 0;
  while(Count < Num)
  {
   X++;
   if (X > Size)
    X -= Size;

   if (bArray[X - 1])
    Count++;
  }
  
  if (bArray[X - 1])
  {
   Q.Add(iArray[X - 1]);
   bArray[X - 1] = false;
  }
 }
 for (int i = 0; i < Size; i++)
 {
  if (i == 0)
   cout << "<" << Q.GetFront() << ", ";
  else if (i == Size - 1)
   cout << Q.GetFront() << ">";
  else
   cout << Q.GetFront() << ", ";
 }
}