Submission #4076057

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second

/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */

int ask(const vector<int>& q) {
  cout << "?";
  for (int x : q) cout << " " << x;
  cout << endl;
  int res;
  cin >> res;
  return res;
}

int main() {
  int N;
  while (cin >> N) {
    vector<int> ans(N, 0);
    for (int i = 0; i < N; i += 6) {
      vector<int> q(N, 0);
      int k = min(i + 6, N);
      int sub = 0, pw = 1;
      for (int j = i; j < k; j++) {
        q[j] = pw;
        sub += 8 * pw;
        pw *= 5;
      }
      int val = ask(q) - sub;
      for (int j = i; j < k; j++) {
        ans[j] = (val % 5) & 1;
        val /= 5;
      }
    }
    cout << "!";
    for (int x : ans) cout << " " << x;
    cout << endl;
    break;
  }
  return 0;
}

Submission Info

Judge Result