0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-24 20:28:48 +00:00
OI-codes/problem/P2069/P2069.cpp

27 lines
512 B
C++
Raw Normal View History

2020-10-20 12:54:32 +00:00
#include <bits/stdc++.h>
using namespace std;
vector<int> listnode;
int main() {
int n, m, k = 1;
listnode.clear();
cin >> n >> m;
for (int i = 0; i < n; i++) {
listnode.push_back(i);
}
for (int i = 1; i <= m; i++) {
int t = i * i * i % 5 + 1;
k += t;
if (k > listnode.size()) {
k = t + 1;
}
if (i != m) {
listnode.erase(listnode.begin() + k - 1);
}
}
cout << listnode[k] << endl;
return 0;
}