結果
問題 | No.1665 quotient replace |
ユーザー | 👑 obakyan |
提出日時 | 2022-01-09 00:14:45 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 2,963 ms / 3,000 ms |
コード長 | 2,135 bytes |
コンパイル時間 | 58 ms |
コンパイル使用メモリ | 5,248 KB |
実行使用メモリ | 21,376 KB |
最終ジャッジ日時 | 2024-04-26 19:36:03 |
合計ジャッジ時間 | 124,520 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2,704 ms
21,216 KB |
testcase_01 | AC | 2,699 ms
21,092 KB |
testcase_02 | AC | 2,610 ms
20,980 KB |
testcase_03 | AC | 2,661 ms
21,248 KB |
testcase_04 | AC | 2,565 ms
21,248 KB |
testcase_05 | AC | 2,521 ms
20,864 KB |
testcase_06 | AC | 2,578 ms
21,052 KB |
testcase_07 | AC | 2,731 ms
20,992 KB |
testcase_08 | AC | 2,699 ms
21,252 KB |
testcase_09 | AC | 2,666 ms
20,864 KB |
testcase_10 | AC | 2,762 ms
21,120 KB |
testcase_11 | AC | 2,819 ms
21,248 KB |
testcase_12 | AC | 2,703 ms
21,008 KB |
testcase_13 | AC | 2,905 ms
21,376 KB |
testcase_14 | AC | 2,884 ms
21,248 KB |
testcase_15 | AC | 2,740 ms
20,864 KB |
testcase_16 | AC | 2,917 ms
20,912 KB |
testcase_17 | AC | 2,892 ms
21,376 KB |
testcase_18 | AC | 2,628 ms
21,060 KB |
testcase_19 | AC | 2,746 ms
20,900 KB |
testcase_20 | AC | 2,557 ms
20,864 KB |
testcase_21 | AC | 2,704 ms
20,992 KB |
testcase_22 | AC | 2,591 ms
20,992 KB |
testcase_23 | AC | 2,596 ms
21,244 KB |
testcase_24 | AC | 2,589 ms
21,096 KB |
testcase_25 | AC | 2,672 ms
20,992 KB |
testcase_26 | AC | 2,734 ms
21,120 KB |
testcase_27 | AC | 2,627 ms
21,008 KB |
testcase_28 | AC | 2,691 ms
21,248 KB |
testcase_29 | AC | 2,584 ms
20,876 KB |
testcase_30 | AC | 2,696 ms
21,248 KB |
testcase_31 | AC | 2,963 ms
20,968 KB |
testcase_32 | AC | 2,893 ms
20,848 KB |
testcase_33 | AC | 2,795 ms
21,116 KB |
testcase_34 | AC | 2,643 ms
21,248 KB |
testcase_35 | AC | 2,820 ms
20,992 KB |
testcase_36 | AC | 2,572 ms
21,056 KB |
testcase_37 | AC | 2,630 ms
21,140 KB |
testcase_38 | AC | 2,726 ms
21,248 KB |
testcase_39 | AC | 2,720 ms
21,120 KB |
testcase_40 | AC | 2,802 ms
21,216 KB |
testcase_41 | AC | 2,832 ms
21,220 KB |
testcase_42 | AC | 2,583 ms
21,072 KB |
testcase_43 | AC | 2,597 ms
20,992 KB |
ソースコード
local bxor = bit.bxor local mce, mfl, msq, mmi, mma, mab = math.ceil, math.floor, math.sqrt, math.min, math.max, math.abs local function getprimes(x) local primes = {} local allnums = {} for i = 1, x do allnums[i] = true end for i = 2, x do if allnums[i] then table.insert(primes, i) local lim = mfl(x / i) for j = 2, lim do allnums[j * i] = false end end end return primes end local function getdivisorparts(x, primes) local prime_num = #primes local tmp = {} local lim = mce(msq(x)) local primepos = 1 local dv = primes[primepos] while primepos <= prime_num and dv <= lim do if x % dv == 0 then local t = {} t.p = dv t.cnt = 1 x = mfl(x / dv) while x % dv == 0 do x = mfl(x / dv) t.cnt = t.cnt + 1 end table.insert(tmp, t) lim = mce(msq(x)) end if primepos == prime_num then break end primepos = primepos + 1 dv = primes[primepos] end if x ~= 1 then local t = {} t.p, t.cnt = x, 1 table.insert(tmp, t) end return tmp end local tt = {0} local function getdivisorCore(divisorparts) local m = {} local pat = 1 local len = #divisorparts local allpat = 1 for i = 1, len do allpat = allpat * (1 + divisorparts[i].cnt) end for t_i_pat = 0, allpat - 2 do local div = allpat local i_pat = t_i_pat local ret = 1 for i = 1, len do div = mfl(div / (divisorparts[i].cnt + 1)) local mul = mfl(i_pat / div) i_pat = i_pat % div for j = 1, mul do ret = ret * divisorparts[i].p end end m[tt[ret]] = true end for i = 0, 1000000 do if not m[i] then return i end end assert(false) return false end local function getdivisor(x, primes) local dvp = getdivisorparts(x, primes) return getdivisorCore(dvp) end local primes = getprimes(1000) for i = 2, 1000 * 1000 do tt[i] = getdivisor(i, primes) end -- print(os.clock()) -- os.exit() local n = io.read("*n") local ret = 0 for i = 1, n do local a = io.read("*n") ret = bxor(ret, tt[a]) end print(ret == 0 and "black" or "white")