結果

問題 No.2357 Guess the Function
ユーザー deuteridayodeuteridayo
提出日時 2023-06-23 21:28:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 2,967 bytes
コンパイル時間 4,642 ms
コンパイル使用メモリ 266,916 KB
実行使用メモリ 25,476 KB
平均クエリ数 3.00
最終ジャッジ日時 2024-07-01 01:05:27
合計ジャッジ時間 5,984 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
24,940 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 24 ms
25,220 KB
testcase_04 AC 24 ms
24,580 KB
testcase_05 WA -
testcase_06 AC 23 ms
24,836 KB
testcase_07 AC 24 ms
24,836 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 24 ms
24,580 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:68:37: warning: 'b' may be used uninitialized [-Wmaybe-uninitialized]
   68 |         cout << "! " << a << " " << b << endl;
      |                                     ^
main.cpp:42:11: note: 'b' was declared here
   42 |     int a,b;
      |           ^

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
// #define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
// using mint = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()

struct edge{
    int to;
};
using graph = vector<vector<edge>>;

int main(){
    int a,b;
    cout << "? 1" << endl;
    int x;
    cin >> x;
    if(x == 0) {
        cout << "? 100" << endl;
        int y;
        cin >> y;
        for(int i = 0; i < 100; i++) {
            if((100 + i) % (i+1) == y) {
                cout << "! "<<i << " " << i+1 << endl;
                return 0;
            }
        }
    } else {
        // a = x-1;
        a = x-1;
        cout << "? 100" << endl;
        int y;
        cin >> y;
        for(int i = a+1; i <= 100; i++) {
            if((100 + a) % i == y) {
                b = i;
                break;
            }
        }
        cout << "! " << a << " " << b << endl;
    }
    
}
0