結果
問題 | No.1700 floor X |
ユーザー |
![]() |
提出日時 | 2021-10-08 21:56:32 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 14 ms / 2,000 ms |
コード長 | 2,388 bytes |
コンパイル時間 | 714 ms |
コンパイル使用メモリ | 116,524 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 12:43:24 |
合計ジャッジ時間 | 2,706 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 44 |
ソースコード
import std.stdio, std.conv, std.functional, std.string;import std.algorithm, std.array, std.container, std.range, std.typecons;import std.bigint, std.numeric, std.math, std.random;import core.bitop;string FMT_F = "%.10f";static File _f;void file_io(string fn) { _f = File(fn, "r"); }static string[] s_rd;T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); }size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }bool inside(T)(T x, T b, T e) { return x >= b && x < e; }T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; }//long mod = 10^^9 + 7;long mod = 998_244_353;//long mod = 1_000_003;void moda(ref long x, long y) { x = (x + y) % mod; }void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }void modm(ref long x, long y) { x = (x * y) % mod; }void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }T binarySearch(alias pred, T)(T ok, T ng){while (abs(ok-ng) > 1){auto mid = (ok+ng)/2;if (unaryFun!pred(mid)) ok = mid;else ng = mid;}return ok;}void main(){auto T = RD;auto ans = new long[](T);foreach (ti; 0..T){auto N = RD;bool f(long x){return x*x <= N;}ans[ti] = binarySearch!(f)(0, 10L^^9+1);}foreach (e; ans)writeln(e);stdout.flush;debug readln;}