| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 627772 | hy_1 | 커다란 상품 (IOI17_prize) | 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 "prize.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <cmath>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <unordered_map>
using namespace std;
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define vi vector < int >
#define int long long
#define llu unsigned long long
#define MOD 1000000007
#define INF 2000000000
#define IN 100001
#define MINF -2000000000
#define all(x) x.begin(),x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
int find_best(int n) {
for(int i =0; i <n; i++){
vector<int> res = ask(i);
if(res[0] == 0 && res[1] == 0){
return i;
}
}
}