0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-18 04:32:00 +00:00

P2069 松鼠吃果子 [90' Code]

This commit is contained in:
Baoshuo Ren 2020-10-20 20:54:32 +08:00 committed by Baoshuo Ren
parent 81b363881a
commit 332460ff29
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

26
problem/P2069/P2069.cpp Normal file
View File

@ -0,0 +1,26 @@
#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;
}