# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159471 | InfiniteJest | Coins (IOI17_coins) | C++14 | 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 <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
typedef long long ll;
int[] coin_flips(int[] b, int c){
int a[64];
for(int i=0;i<10;i++){
if(c&(1<<(9-i)))a[i]=1;
else a[i]=0;
}
return a;
}
int find_coin(int[] b){
int num=0;
for(int i=0;i<10;i++){
if(b[i]==1)num+=pow(2,9-i);
}
}