Submission #3426623

---

Source Code Expand

#include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
//#include <boost/multiprecision/cpp_int.hpp>

const double EPS = (1e-10);


using namespace std;
using Int = long long;
//using namespace boost::multiprecision;

const Int MOD = 1000000007;

Int mod_pow(Int x, Int n) {
    Int res = 1;
    while(n > 0) {
        if(n & 1) res = (res * x) % MOD; //ビット演算(最下位ビットが1のとき)
        x = (x * x) % MOD;
        n >>= 1; //右シフト(n = n >> 1)
    }
    return res;
}

int ans[55];


int main(){
    //cin.tie(0);

    int N; cin >> N;
    for (int i = 0; i < N; i += 5){
        cout << "? ";
        for (int j = 0; j < N; j++){
            if (i <= j && j < i + 5) cout << mod_pow(10, j-i);
            else cout << "0";
            cout << " ";
        }
        cout << endl;

        int res; cin >> res;

        for (int j = i; j < N && j < i + 5; j++){
            int tmp = res%10;
            if (tmp == 0) ans[j] = 10;
            if (tmp == 1) ans[j] = 11;
            if (tmp == 2) ans[j] = 12;
            if (tmp == 9) ans[j] = 9;
            if (tmp == 8) ans[j] = 8;
            res -= ans[j];
            res /= 10;
        }
    }

    cout << "! ";
    for (int i = 0; i < N; i++){
        cout << ans[i]%2;
        cout << " ";        
    }
    cout << endl;

}

Submission Info

Judge Result