結果
問題 | No.810 割った余りの個数 |
ユーザー |
|
提出日時 | 2021-07-09 16:10:30 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 4,597 bytes |
コンパイル時間 | 12,658 ms |
コンパイル使用メモリ | 298,612 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-01 14:00:53 |
合計ジャッジ時間 | 13,806 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
def solve(io)l, r, m = io.get3io.put Math.min(m, r-l+1)endstruct 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}})endsolve(ProconIO.new)