結果
問題 | No.811 約数の個数の最大化 |
ユーザー |
|
提出日時 | 2021-07-09 16:38:14 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 84 ms / 2,000 ms |
コード長 | 6,682 bytes |
コンパイル時間 | 13,047 ms |
コンパイル使用メモリ | 305,452 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-01 14:01:13 |
合計ジャッジ時間 | 14,273 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
ソースコード
def solve(io)n, k = io.get2pf = PrimeFactor.sqrt(n)dn = pf.div(n)fn = dn.flat_map { |f| (1..f.exp).map { |e| f.prime ** e } }r = ri = 0(1...n).each do |i|di = pf.div(i)fi = di.flat_map { |f| (1..f.exp).map { |e| f.prime ** e } }next if (fn & fi).size < kds = di.map(&.exp).map(&.+ 1).productif ds > rr = dsri = iendendio.put riendstruct Intdef cdiv(b : Int)(self + b - 1) // benddef bit?(i : Int)bit(i) == 1enddef set_bit(i : Int)self | (self.class.new(1) << i)enddef reset_bit(i : Int)self & ~(self.class.new(1) << i)end{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.34.0") < 0 %}def bit_length : Int32x = self < 0 ? ~self : selfif x.is_a?(Int::Primitive)Int32.new(sizeof(self) * 8 - x.leading_zeros_count)elseto_s(2).sizeendend{% end %}endstruct Int32SQRT_MAX = 46_340_i32def isqrtm = SQRT_MAXr = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendstruct Int64SQRT_MAX = 3_037_000_499_i64def isqrtr = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendstruct Number{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.1.0") < 0 %}def zero?self == 0enddef positive?self > 0enddef negative?self < 0end{% end %}{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}def self.additive_identityzeroenddef self.multiplicative_identitynew(1)end{% end %}endclass Arraymacro new_md(*args, &block){% if !block %}{% for arg, i in args[0...-2] %}Array.new({{arg}}) {{% end %}Array.new({{args[-2]}}, {{args[-1]}}){% for arg in args[0...-2] %}}{% end %}{% else %}{% for arg, i in args %}Array.new({{arg}}) { |_i{{i}}|{% end %}{% for block_arg, i in block.args %}{{block_arg}} = _i{{i}}{% end %}{{block.body}}{% for arg in args %}}{% end %}{% end %}endendclass ProconIOdef initialize(@ins : IO = STDIN, @outs : IO = STDOUT)@buf = [] of String@index = 0enddef get(k : T.class = Int32) forall Tget_v(k)endmacro define_get{% for i in (2..9) %}def get({% for j in (1..i) %}k{{j}}{% if j < i %},{% end %}{% end %}){{% for j in (1..i) %}get(k{{j}}){% if j < i %},{% end %}{% end %}}end{% end %}enddefine_getmacro define_getn{% for i in (2..9) %}def get{{i}}(k : T.class = Int32) forall Tget({% for j in (1..i) %}k{% if j < i %}, {% end %}{% end %})end{% end %}enddefine_getndef get_a(n : Int, k : T.class = Int32) forall TArray.new(n) { get_v(k) }enddef get_c(n : Int, k : T.class = Int32) forall Tget_a(n, k)endmacro define_get_c{% for i in (2..9) %}def get_c(n : Int,{% for j in (1..i) %}k{{j}}{% if j < i %},{% end %}{% end %})a = Array.new(n) doget({% for j in (1..i) %}k{{j}}{% if j < i %},{% end %}{% end %})end{{% for j in (1..i) %}a.map { |e| e[{{j-1}}] }{% if j < i %},{% end %}{% end %}}end{% end %}enddefine_get_cmacro define_getn_c{% for i in (2..9) %}def get{{i}}_c(n : Int, k : T.class = Int32) forall Tget_c(n,{% for j in (1..i) %}k{% if j < i %}, {% end %}{% end %})end{% end %}enddefine_getn_cdef get_m(r : Int, c : Int, k : T.class = Int32) forall TArray.new(r) { get_a(c, k) }enddef put(*vs)vs.each.with_index do |v, i|put_v(v)@outs.print i < vs.size - 1 ? " " : "\n"endenddef put_e(*vs)put(*vs)exitendprivate def get_v(k : Int32.class); get_token.to_i32; endprivate def get_v(k : Int64.class); get_token.to_i64; endprivate def get_v(k : String.class); get_token; endprivate def get_tokenif @buf.size == @indexstr = @ins.read_line@buf = str.split@index = 0endv = @buf[@index]@index += 1vendprivate def put_v(vs : Enumerable)vs.each_with_index do |v, i|@outs.print v@outs.print " " if i < vs.size - 1endendprivate def put_v(v)@outs.print vendendmacro min_u(a, b){{a}} = Math.min({{a}}, {{b}})endmacro max_u(a, b){{a}} = Math.max({{a}}, {{b}})endrequire "bit_array"def powr(a : T, n : Int, i : T = T.multiplicative_identity) forall Tpowr(a, n, i) { |a, b| a * b }enddef powr(a : T, n : Int, i : T = T.multiplicative_identity, &block) forall Treturn i if n == 0r, b = i, awhile n > 0r = yield r, b if n.bit(0) == 1b = yield b, bn >>= 1endrenddef ext_gcd(a : T, b : T) forall Tif a == 0{b, T.new(0), T.new(1)}elseg, x, y = ext_gcd(b%a, a){g, y-(b//a)*x, x}endendclass PrimeFactordef initialize(@n : Int32)s = (@n+1)//2sieve = BitArray.new(s, true)if @n < 2@primes = [] of Int32returnend(1..(n.isqrt-1)//2).each do |p|if sieve[p](p*3+1...s).step(p*2+1) do |q|sieve[q] = falseendendend@primes = [2](1...s).each do |p|@primes << p*2+1 if sieve[p]endenddef self.sqrt(n : Int)self.new(n.isqrt.to_i32)endgetter primes : Array(Int32)record Factor(T), prime : T, exp : Int32def div(x : T) forall Tfactors = [] of Factor(T)t = x.isqrt@primes.each do |p|break if p > tc = 0while x%p == 0c += 1x //= pendfactors << Factor.new(T.new(p), c) if c > 0break if x == 1endfactors << Factor.new(x, 1) if x > 1factorsenddef divisors(x : T) forall Tfactors = div(x)r = divisors_proc(factors, 0, T.multiplicative_identity)r.sort!enddef divisors_proc(factors : Array(Factor(T)), i : Int32, c : T) forall Treturn [c] if i == factors.sizer = [] of T(0..factors[i].exp).each do |j|r.concat(divisors_proc(factors, i+1, c * factors[i].prime**j))endrendendsolve(ProconIO.new)