# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006136 | Abdullah_Alodaibi | Coins (IOI17_coins) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <coins.h>
using namespace std;
vector<int> coin_flips(vector<int> b, int c){
ll x=0;
for(int i=0;i<b.size();i++){
x+=b[i]*i;
x%=b.size();
}
b[((c+b.size())-x)%b.size()]=(b[((c+b.size())-x)%b.size()]+1)%2;
return b;
}
int find_coin(vector<int> b){
ll x=0;
for(int i=0;i<b.size();i++){
x+=b[i]*i;
x%=b.size();
}
return x;
}