Submission
Status:
PPPPPPPPPP
Score: 100
User: ShynyC
Problemset: ของขวัญและขโมย
Language: cpp
Time: 0.023 second
Submitted On: 2025-04-19 00:34:00
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
int n,k,thief,current = 0;
cin >> n >> k >> thief;
vector<int> people;
set<int> visited;
for(int i = 0; i < n; i++){
people.push_back(i);
}
visited.insert(0);
do{
if(current + k < n){
current = current + k;
}else{
current = current + k;
while(current >= n){
current = current - n;
}
}
visited.insert(current);
//cout << current << " ";
}while((current != thief-1 && current != 0));
cout << visited.size();
}