結果
問題 | No.864 四方演算 |
ユーザー |
|
提出日時 | 2021-07-24 17:51:48 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 7 ms / 1,000 ms |
コード長 | 6,412 bytes |
コンパイル時間 | 18,596 ms |
コンパイル使用メモリ | 309,360 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-20 00:15:40 |
合計ジャッジ時間 | 15,130 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
コンパイルメッセージ
In Main.cr:29:19 29 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:30:15 30 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:29:19 29 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:30:15 30 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:29:19 29 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:30:15 30 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:29:19 29 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:30:15 30 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:29:19 29 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:30:15 30 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:29:19 29 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:30:15 30 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:29:19 29 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:30:15 30
ソースコード
def solve(io)n, k = io.get2(Int64)pf = PrimeFactor.sqrt(k)r = 0_i64pf.divisors(k).each do |d|e = k // dm1 = d - 1 <= n ? d - 1 : (n * 2 - d + 1).clamp(0..)m2 = e - 1 <= n ? e - 1 : (n * 2 - e + 1).clamp(0..)r += m1 * m2endio.put rendclass ProconIOdef initialize(@ins : IO = STDIN, @outs : IO = STDOUT)@buf = IO::Memory.new("")enddef get(k : T.class = Int32) forall Tget_v(k)endmacro define_get{% for i in (2..9) %}def get({{ *(1..i).map { |j| "k#{j}".id } }}){ {{ *(1..i).map { |j| "get(k#{j})".id } }} }end{% end %}enddefine_getmacro define_getn{% for i in (2..9) %}def get{{i}}(k : T.class = Int32) forall Tget({{ *(1..i).map { "k".id } }})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, {{ *(1..i).map { |j| "k#{j}".id } }})a = Array.new(n) { get({{ *(1..i).map { |j| "k#{j}".id } }}) }{ {{ *(1..i).map { |j| "a.map { |e| e[#{j-1}] }".id } }} }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, {{ *(1..i).map { "k".id } }})end{% end %}enddefine_getn_cdef get_m(r : Int, c : Int, k : T.class = Int32) forall TArray.new(r) { get_a(c, k) }endmacro define_put{% for i in (1..9) %}def put({{ *(1..i).map { |j| "v#{j}".id } }}, *, delimiter = " "){% for j in (1..i) %}print_v(v{{j}}, delimiter){% if j < i %}@outs << delimiter{% end %}{% end %}@outs.putsend{% end %}enddefine_putdef put_e(*vs)put(*vs)exitenddef put_f(*vs)put(*vs)@outs.flushendprivate 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 : UInt32.class); get_token.to_u32; endprivate def get_v(k : UInt64.class); get_token.to_u64; endprivate def get_v(k : Float64.class); get_token.to_f64; endprivate def get_v(k : String.class); get_token; endprivate def get_tokenloop dotoken = @buf.gets(' ', chomp: true)break token unless token.nil?@buf = IO::Memory.new(@ins.read_line)endendprivate def print_v(v, dlimiter)@outs << vendprivate def print_v(v : Enumerable, delimiter)v.each_with_index do |e, i|@outs << e@outs << delimiter if i < v.size - 1endendendstruct 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 Float64def near_zero?self.abs < EPSILONendendstruct 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 %}endendmodule Math{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.2.0") < 0 %}def isqrt(value : Int::Primitive)raise ArgumentError.new "Input must be non-negative integer" if value < 0return value if value < 2res = value.class.zerobit = res.succ << (res.leading_zeros_count - 2)bit >>= value.leading_zeros_count & ~0x3while (bit != 0)if value >= res + bitvalue -= res + bitres = (res >> 1) + bitelseres >>= 1endbit >>= 2endresend{% end %}endmacro min_u(a, b){{a}} = Math.min({{a}}, {{b}})endmacro max_u(a, b){{a}} = Math.max({{a}}, {{b}})endmacro zip(a, *b, &block){{a}}.zip({{*b}}) {{block}}endrequire "bit_array"class PrimeFactordef initialize(@n : Int32)s = (@n+1)//2sieve = BitArray.new(s, true)if @n < 2@primes = [] of Int32returnend(1..(Math.isqrt(n)-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(Math.isqrt(n).to_i32)endgetter primes : Array(Int32)record Factor(T), prime : T, exp : Int32def div(x : T) forall Tfactors = [] of Factor(T)t = Math.isqrt(x)@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)