#751849 (D) No.3093 Please GCD

• 問題: No.3093 Please GCD
• ユーザー: 👑 hos.lyric
• 提出日時: 2022-04-05 00:11:31
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 199 ms / 2,000 ms
• コード長: 1,599 bytes
• コンパイル時間: 1,897 ms
• コンパイル使用メモリ: 157,040 KB
• 実行使用メモリ: 25,460 KB
• 平均クエリ数: 892.00
• 最終ジャッジ日時: 2024-06-22 14:48:43
• 合計ジャッジ時間: 7,074 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	25 ms; 24,836 KB
testcase_01	AC	26 ms; 24,836 KB
testcase_02	AC	53 ms; 24,836 KB
testcase_03	AC	196 ms; 25,220 KB
testcase_04	AC	63 ms; 24,964 KB
testcase_05	AC	198 ms; 24,964 KB
testcase_06	AC	64 ms; 25,220 KB
testcase_07	AC	64 ms; 24,836 KB
testcase_08	AC	63 ms; 24,836 KB
testcase_09	AC	83 ms; 24,836 KB
testcase_10	AC	23 ms; 24,836 KB
testcase_11	AC	51 ms; 25,220 KB
testcase_12	AC	161 ms; 25,220 KB
testcase_13	AC	72 ms; 24,836 KB
testcase_14	AC	62 ms; 24,836 KB
testcase_15	AC	43 ms; 25,220 KB
testcase_16	AC	66 ms; 24,836 KB
testcase_17	AC	145 ms; 24,964 KB
testcase_18	AC	80 ms; 25,460 KB
testcase_19	AC	75 ms; 24,836 KB
testcase_20	AC	64 ms; 24,836 KB
testcase_21	AC	199 ms; 24,580 KB
testcase_22	AC	199 ms; 24,836 KB
testcase_23	AC	64 ms; 25,220 KB
testcase_24	AC	73 ms; 24,580 KB
testcase_25	AC	63 ms; 24,836 KB
testcase_26	AC	60 ms; 25,220 KB
testcase_27	AC	68 ms; 24,580 KB
testcase_28	AC	61 ms; 24,836 KB
testcase_29	AC	60 ms; 25,076 KB

コンパイルメッセージ

/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!uint.gcdImpl`

ソースコード

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


debug {
enum L = 3;
} else {
enum L = 600;
}

void main() {
  const N = readInt;
  
  auto gs = new int[L + 2];
  foreach (i; 2 .. L + 2) if (i <= N) {
    writefln("? %s", i);
    stdout.flush;
    gs[i] = readInt;
  }
  
  foreach (x; 1 .. N + 1) {
    bool ok = true;
    foreach (i; 2 .. L + 2) if (i <= N) {
      ok = ok && (gs[i] == gcd(x, i));
    }
    if (ok) {
      writefln("! %s", x);
    }
  }
  stdout.flush;
}