結果
問題 |
No.375 立方体のN等分 (1)
|
ユーザー |
👑 |
提出日時 | 2019-05-06 23:34:59 |
言語 | Lua (LuaJit 2.1.1734355927) |
結果 |
AC
|
実行時間 | 238 ms / 5,000 ms |
コード長 | 2,275 bytes |
コンパイル時間 | 218 ms |
コンパイル使用メモリ | 5,376 KB |
実行使用メモリ | 7,296 KB |
最終ジャッジ日時 | 2024-06-28 14:10:56 |
合計ジャッジ時間 | 2,046 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 |
ソースコード
local n = io.read("*n") 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 = math.floor(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 = math.ceil(math.sqrt(x)) local primepos = 1 local dv = primes[primepos] while(primepos <= prime_num and dv <= lim) do if(x % dv == 0) then local asdf = {} asdf.p = dv asdf.cnt = 1 x = x / dv while(x % dv == 0) do x = x / dv asdf.cnt = asdf.cnt + 1 end table.insert(tmp, asdf) lim = math.ceil(math.sqrt(x)) end if(primepos == prime_num) then break end primepos = primepos + 1 dv = primes[primepos] end if(x ~= 1) then local asdf = {} asdf.p, asdf.cnt = x, 1 table.insert(tmp, asdf) end return tmp end local function getdivisor(divisorparts) local t = {} local pat = 1 local len = #divisorparts local allpat = 1 for i = 1, len do allpat = allpat * (divisorparts[i].cnt + 1) end for t_i_pat = 0, allpat - 1 do local div = allpat local i_pat = t_i_pat local ret = 1 for i = 1, len do div = math.floor(div / (divisorparts[i].cnt + 1)) local mul = math.floor(i_pat / div) i_pat = i_pat % div for j = 1, mul do ret = ret * divisorparts[i].p end end table.insert(t, ret) end table.sort(t) return t end local retmin, retmax = n - 1, n - 1 local primes = getprimes(math.ceil(math.sqrt(n))) local divisorparts = getdivisorparts(n, primes) local divisor = getdivisor(divisorparts) local dmax = math.ceil(n^(1/3)) for i = 1, #divisor do if(dmax < divisor[i]) then break end local rem = math.floor(n / divisor[i]) local remparts = getdivisorparts(rem, primes) local remdiv = getdivisor(remparts) local remlim = math.ceil(math.sqrt(rem)) for j = 1, #remdiv do if(remlim < remdiv[j]) then break end local last = math.floor(rem / remdiv[j]) retmin = math.min(retmin, divisor[i] + remdiv[j] + last - 3) end end print(retmin .. " " .. retmax)