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

• 問題: No.3501 Digit Products 2
• ユーザー: GOTKAKO
• 提出日時: 2026-04-17 21:38:34
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 4,488 bytes
• コンパイル時間: 2,267 ms
• コンパイル使用メモリ: 219,364 KB
• 実行使用メモリ: 30,332 KB
• 平均クエリ数: 10.44
• 最終ジャッジ日時: 2026-04-17 21:39:00
• 合計ジャッジ時間: 18,454 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_1

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

ソースコード

#include <bits/stdc++.h>
using namespace std;

//入力が必ず-mod<=a<modの時.
template<const int mod> //mod<2^30.
struct modint{ //mod変更が不可能.
    public:
    long long v;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint():v(0){}
    template<typename T>
    modint(T a):v(a){if(v < 0) v += mod;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint &operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint &operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint &operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint &operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint &operator/=(modint b){ //b!=0 mod素数が必須.
        assert(b.v != 0);
        (*this) *= b.pow(mod-2);
        return *this;
    }
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return pow(mod-2);} //素数mod必須.
 
    modint &operator++(){*this += 1; return *this;}
    modint &operator--(){*this -= 1; return *this;}
    modint operator++(int){modint ret = *this; *this += 1; return ret;}
    modint operator--(int){modint ret = *this; *this -= 1; return ret;}
    friend bool operator==(const modint a,const modint b){return a.v==b.v;}
    friend bool operator!=(const modint a,const modint b){return a.v!=b.v;}
    friend bool operator<(const modint a,const modint b){return a.v<b.v;}
    friend bool operator<=(const modint a,const modint b){return a.v<=b.v;}
    friend bool operator>=(const modint a,const modint b){return a.v>=b.v;}
    friend bool operator>(const modint a,const modint b){return a.v>b.v;}
    friend ostream &operator<<(ostream &os,const modint a){return os<<a.v;}
    friend istream &operator>>(istream &is,modint &a){ //入力はmodをとってくれる.
        long long x; is >> x; x %= mod;
        a = modint(x); return is;
    }
};
using mint = modint<998244353>; const long long mod = 998244353;

template<typename T>
vector<pair<T,long long>> RLE(vector<T> &A){
    if(A.size() == 0) return {};
    vector<pair<T,long long>> ret;
    T back = A.at(0);
    long long streak = 1;
    for(int i=1; i<A.size(); i++){
        if(back == A.at(i)) streak++;
        else{
            ret.push_back({back,streak});
            back = A.at(i); streak = 1;
        }
    }
    ret.push_back({back,streak});
    return ret;
}
vector<pair<char,long long>> RLE(string &s){
    if(s.size() == 0) return {};
    vector<pair<char,long long>> ret;
    char back = s.at(0);
    long long streak = 1;
    for(int i=1; i<s.size(); i++){
        if(back == s.at(i)) streak++;
        else{
            ret.push_back({back,streak});
            back = s.at(i); streak = 1;
        }
    }
    ret.push_back({back,streak});
    return ret;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    vector<int> X(N-1);
    int zero = 0;
    for(int i=0; i<N-1; i++){
        cout << "? " << N-1 << " " << i << endl;
        cin >> X.at(i);
        zero += X.at(i)==0;
    }
    string answer(N,'-');
    vector<int> V;
    for(int v=1; v<10; v++){
        bool ok = true;
        for(auto x : X){
            if(x%v){ok = false; break;}
            if(0 <= x/v && x/v <= 9) continue;
            ok = false; break;
        }
        if(ok) V.push_back(v);
    }
    
    if(V.size() > 1){ 
        vector<int> P;
        for(int i=0; i<N-1; i++) if(X.at(i)) P.push_back(i);
        if(P.size() < 2){cout << "! -1\n"; return 0;}
        cout << "? " << P.at(0) << " " << P.at(1) << endl;
        int x; cin >> x;
        x = X.at(P.at(0))*X.at(P.at(1))/x;
        x = sqrt(x);
        V = {x};
    }
    if(V.size() == 1){
        answer.at(N-1) = V.at(0)+'0';
        for(int i=0; i<N-1; i++) answer.at(i) = X.at(i)/V.at(0)+'0';
        reverse(answer.begin(),answer.end());
    }
    cout << "! " << answer << endl;
}