Submission #627779

#	Time	Username	Problem	Language	Result	Execution time	Memory
627779		hy_1	The Big Prize (IOI17_prize)	C++14	0 / 100	89 ms	216 KiB

prize

#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;


int find_best(int n) {
	for(int i  =0; i <n; i++){
		vector<int> res = ask(i);
		if(res[0] + res[1] == 0){
			return i;
		}
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^

• Subtask 1: 0 / 20
• Subtask 2: 0 / 80