| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 241577 | Mercenary | Coins (IOI17_coins) | C++14 | 20 ms | 2036 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"
#include<bits/stdc++.h>
using namespace std;
vector<int> coin_flips(std::vector<int> b, int c) {
int res = 0;
for(int i = 0 ; i < 64 ; ++i)if(b[i])res ^= i;
return vector<int>(1 , res ^ c);
}
int find_coin(std::vector<int> b) {
int res = 0;
for(int i = 0 ; i < 64 ; ++i)if(b[i])res ^= i;
return res;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
