# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588320 | supercatex | Counting Mushrooms (IOI20_mushrooms) | 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 <bits/stdc++.h>
using namespace std;
int use_machine(int[]);
int count_mushrooms(int n)
{
vector<int> a, b;
a.push_back(0);
for (int i = 1; i < n; i++) {
int q[] = {0, i};
int x = use_machine(q);
if (x == 0) a.push_back(i);
else b.push_back(i);
}
return a.size();
}