#include <iostream>
using namespace std;
int findLastNum(int k,int n)
{
int t;
int begin = 0;
int* arr = new int[n];
for(int i = 0;i<n;i++)
arr[i] = i;
int count = 0;
//i = 0;
while(count<n-1)
{
t=0;
for(int j = begin;1;j++)
{
if(arr[j%n]!=-1)
{
t++;
}
if(t==k)
{
arr[j%n] = -1;
begin = j+1;
break;
}
}
count++;
}
cout<<endl;
for( i = 0;i<n;i++)
if(arr[i]!=-1)
cout<<arr[i]<<endl;
return arr[i];
};
int main()
{
findLastNum(1,1);
return 0;
using namespace std;
int findLastNum(int k,int n)
{
int t;
int begin = 0;
int* arr = new int[n];
for(int i = 0;i<n;i++)
arr[i] = i;
int count = 0;
//i = 0;
while(count<n-1)
{
t=0;
for(int j = begin;1;j++)
{
if(arr[j%n]!=-1)
{
t++;
}
if(t==k)
{
arr[j%n] = -1;
begin = j+1;
break;
}
}
count++;
}
cout<<endl;
for( i = 0;i<n;i++)
if(arr[i]!=-1)
cout<<arr[i]<<endl;
return arr[i];
};
int main()
{
findLastNum(1,1);
return 0;
}