結果
問題 | No.841 8/32 |
ユーザー |
|
提出日時 | 2021-07-06 21:11:39 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,498 bytes |
コンパイル時間 | 17,341 ms |
コンパイル使用メモリ | 295,404 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-01 12:13:31 |
合計ジャッジ時間 | 12,505 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
def solve(io)s1, s2 = io.get2(String)if %w[Sat Sun].includes?(s1) && %[Sat Sun].includes?(s2)io.put "8/33"elsif %w[Sat Sun].includes?(s1)io.put "8/32"elseio.put "8/31"endendclass 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 %}endendstruct Intdef cdiv(b : Int)(self + b - 1) // bend{% 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", "0.36.0") < 0 %}def self.additive_identityzeroenddef self.multiplicative_identitynew(1)end{% end %}endclass ProconIOdef initialize@buf = [] of String@index = 0enddef get(k : T.class = Int32) forall Tget_v(k)enddef get(*ks : T.class) forall Tks.map { |k| get_v(k) }endmacro 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)enddef get_c(n : Int, *ks : T.class) forall Ta = Array.new(n) { get(*ks) }ks.map_with_index { |_, i| a.map { |e| e[i] } }endmacro 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)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 == @index@buf = read_line.split@index = 0endv = @buf[@index]@index += 1vendprivate def put_v(vs : Enumerable)vs.each_with_index do |v, i|print vprint " " if i < vs.size - 1endendprivate def put_v(v)print vendendmacro min_u(a, b){{a}} = Math.min({{a}}, {{b}})endmacro max_u(a, b){{a}} = Math.max({{a}}, {{b}})endsolve(ProconIO.new)