結果
問題 | No.944 煎っぞ! |
ユーザー |
👑 |
提出日時 | 2019-12-14 00:45:14 |
言語 | Lua (LuaJit 2.1.1734355927) |
結果 |
AC
|
実行時間 | 24 ms / 3,000 ms |
コード長 | 2,215 bytes |
コンパイル時間 | 107 ms |
コンパイル使用メモリ | 5,376 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-27 23:48:00 |
合計ジャッジ時間 | 1,903 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 35 |
ソースコード
local mce, mfl, msq, mmi, mma, mab = math.ceil, math.floor, math.sqrt, math.min, math.max, math.abslocal function getprimes(x)local primes = {}local allnums = {}for i = 1, x do allnums[i] = true endfor i = 2, x doif allnums[i] thentable.insert(primes, i)local lim = mfl(x / i)for j = 2, lim doallnums[j * i] = falseendendendreturn primesendlocal function getdivisorparts(x, primes)local prime_num = #primeslocal tmp = {}local lim = mce(msq(x))local primepos = 1local dv = primes[primepos]while(primepos <= prime_num and dv <= lim) doif(x % dv == 0) thenlocal asdf = {}asdf.p = dvasdf.cnt = 1x = x / dvwhile(x % dv == 0) dox = x / dvasdf.cnt = asdf.cnt + 1endtable.insert(tmp, asdf)lim = mce(msq(x))endif(primepos == prime_num) then break endprimepos = primepos + 1dv = primes[primepos]endif(x ~= 1) thenlocal asdf = {}asdf.p, asdf.cnt = x, 1table.insert(tmp, asdf)endreturn tmpendlocal function getdivisor(divisorparts)local t = {}local pat = 1local len = #divisorpartslocal allpat = 1for i = 1, len doallpat = allpat * (1 + divisorparts[i].cnt)endfor t_i_pat = 0, allpat - 1 dolocal div = allpatlocal i_pat = t_i_patlocal ret = 1for i = 1, len dodiv = mfl(div / (divisorparts[i].cnt + 1))local mul = mfl(i_pat / div)i_pat = i_pat % divfor j = 1, mul doret = ret * divisorparts[i].pendendtable.insert(t, ret)endtable.sort(t)return tendlocal n = io.read("*n")local a = {}local sum = 0for i = 1, n doa[i] = io.read("*n")sum = sum + a[i]endlocal function solve(x)local cnt = 0local val = 0for i = 1, n doval = val + a[i]if val == x thencnt = cnt + 1val = 0elseif x < val thenreturn 0endendreturn cntendlocal primes = getprimes(mce(msq(sum)))local divps = getdivisorparts(sum, primes)local divs = getdivisor(divps)for i = 1, #divs dolocal cnt = solve(divs[i])if 0 < cnt thenprint(cnt)breakendend