| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1220869 | AlgorithmWarrior | Coins (IOI17_coins) | C++20 | 9 ms | 744 KiB |
#include "coins.h"
#include <bits/stdc++.h>
using namespace std;
int codif(vector<int>b){
int rez=0;
int i;
for(i=0;i<64;++i)
rez^=b[i]*i;
return rez;
}
vector<int>coin_flips(vector<int>b,int c) {
return {codif(b)^c};
}
int find_coin(vector<int>b){
return codif(b);
}| # | 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... | ||||
