#1159220 (C++17) No.3501 Digit Products 2

• 問題: No.3501 Digit Products 2
• ユーザー: jupiter_68
• 提出日時: 2026-04-18 06:18:45
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 17 ms / 2,000 ms
• コード長: 3,418 bytes
• コンパイル時間: 2,106 ms
• コンパイル使用メモリ: 215,812 KB
• 実行使用メモリ: 30,320 KB
• 平均クエリ数: 10.89
• 最終ジャッジ日時: 2026-04-18 06:18:58
• 合計ジャッジ時間: 12,004 ms
• ジャッジサーバーID （参考情報）: judge3_1 / judge1_0

ファイルパターン	結果
sample	AC * 1
other	AC * 72

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vl = vector<ll>;
template <class T> using vec = vector<T>;
template <class T> using vv = vec<vec<T>>;
template <class T> using vvv = vv<vec<T>>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, l, r) for(ll i = (l); i < (r); ++i)
#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)
#define sz(x) (ll) (x).size()
template <typename T>
bool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }
template <typename T>
bool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }

const ll mod = 998244353; // 1000000007;

struct mint {
    ll x;
    mint(ll y = 0) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    mint &operator+=(const mint &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator-=(const mint &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator*=(const mint &p) {
        x = (ll)(1ll * x * p.x % mod);
        return *this;
    }
    mint &operator/=(const mint &p) {
        *this *= p.inv();
        return *this;
    }
    mint operator-() const { return mint(-x); }
    mint operator+(const mint &p) const { return mint(*this) += p; }
    mint operator-(const mint &p) const { return mint(*this) -= p; }
    mint operator*(const mint &p) const { return mint(*this) *= p; }
    mint operator/(const mint &p) const { return mint(*this) /= p; }
    bool operator==(const mint &p) const { return x == p.x; }
    bool operator!=(const mint &p) const { return x != p.x; }
    friend ostream &operator<<(ostream &os, const mint &p) { return os << p.x; }
    friend istream &operator>>(istream &is, mint &a) {
        ll t; is >> t; a = mint(t); return (is);
    }
    mint inv() const { return pow(mod - 2); }
    mint pow(ll n) const {
        mint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
};

void solve(){
    ll N; cin >> N;
    vl a(N-1);
    vl b(N);
    rep(i, N-1){
        cout << "? " << i << " " << N-1 << endl;
        cin >> a[i];
    }
    ll l = -1, r = -1;
    rep(i, N-1){
        if(a[i] == 0){
            b[i] = 0;
        }else{
            if(l == -1) l = i;
            else r = i;
        }
    }
    vl sq = {1, 25, 49, 64, 81};
    if(r == -1){
        if(l == -1){
            cout << "! -1" << endl;
            return;
        }
        if(count(all(sq), a[l])){
            ll s = sqrt(a[l] + 1);
            b[l] = s, b[N-1] = s;
            cout << "! ";
            rrep(i, 0, N){
                cout << b[i];
            }
            cout << endl;
            return;
        }
        cout << "! -1" << endl;
        return;
    }
    cout << "? " << l << " " << r << endl;
    ll x; cin >> x;
    b[N-1] = a[l] * a[r] / x;
    b[N-1] = sqrt(b[N-1] + 1);
    rep(i, N-1){
        b[i] = a[i] / b[N-1];
    }
    cout << "! ";
    rrep(i, 0, N){
        cout << b[i];
    }
    cout << endl;
    return;
}

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}