Submission #334840

#TimeUsernameProblemLanguageResultExecution timeMemory
334840TricksterXoractive (IZhO19_xoractive)C++14
6 / 100
1 ms364 KiB
//Suleyman Atayew
 
#include "interactive.h"
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <bitset>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>
 
#define N 200010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <int, int>
#define sz(a) (int)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }

using namespace std;

vector <int> guess(int n)
{
    vector <int> A;

    for(int i = 1; i <= n; i++) {
        A.pb(ask(i));
    }

    return A;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...