結果
問題 | No.908 うしたぷにきあくん文字列 |
ユーザー | nadeshino |
提出日時 | 2019-10-18 21:23:45 |
言語 | Nim (2.0.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,733 bytes |
コンパイル時間 | 2,900 ms |
コンパイル使用メモリ | 73,004 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-25 14:47:31 |
合計ジャッジ時間 | 3,698 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'algorithm' [UnusedImport] /home/judge/data/code/Main.nim(2, 19) Warning: imported and not used: 'sugar' [UnusedImport] /home/judge/data/code/Main.nim(2, 34) Warning: imported and not used: 'math' [UnusedImport]
ソースコード
#import algorithm, future, macros, math, sequtils, sets, strutils, tables import algorithm, sugar, macros, math, sequtils, sets, strutils, tables macro unpack(rhs: seq, cnt: static[int]): auto = let v = genSym(); result = quote do:(let `v` = `rhs`;()) if NimMinor <= 17: for i in 0..<cnt: result[0][1].add(quote do:`v`[`i`]) else: for i in 0..<cnt: result[1].add(quote do:`v`[`i`]) template input(T: typedesc, cnt: Natural = 1): untyped = let line = stdin.readLine.split(" ") when T is int: line.map(parseInt).unpack(cnt) elif T is float: line.map(parseFloat).unpack(cnt) elif T is string: line.unpack(cnt) elif T is char: line.mapIt(it[0]).unpack(cnt) elif T is seq[int]: line.map(parseint) elif T is seq[float]: line.map(parseFloat) elif T is seq[string]: line elif T is seq[char]: line.mapIt(it[0]) proc `&=`(n: var int, m: int) = n = n and m proc `|=`(n: var int, m: int) = n = n or m proc `%=`(n: var int, m: int) = n = n mod m proc `//=`(n: var int, m: int) = n = n div m proc `<<=`(n: var int, m: int) = n = n shl m proc `>>=`(n: var int, m: int) = n = n shr m proc `<?=`(n: var SomeNumber, m: SomeNumber) = n = min(n, m) proc `>?=`(n: var SomeNumber, m: SomeNumber) = n = max(n, m) proc newSeq2[T](n1, n2: Natural): seq[seq[T]] = newSeqWith(n1, newSeq[T](n2)) proc newSeq3[T](n1, n2, n3: Natural): seq[seq[seq[T]]] = newSeqWith(n1, newSeqWith(n2, newSeq[T](n3))) # -------------------------------------------------- # var S = stdin.readline echo S var flag = true for i, e in S: if i mod 2 == 1: if e != ' ': flag = false else: if not (ord('a') <= ord(e) and ord(e) <= ord('z')): flag = false if flag: echo "Yes" else: echo "No"