結果
問題 | No.982 Add |
ユーザー |
![]() |
提出日時 | 2020-02-11 13:36:23 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,161 bytes |
コンパイル時間 | 3,805 ms |
コンパイル使用メモリ | 84,676 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-01 07:22:04 |
合計ジャッジ時間 | 4,158 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'algorithm' [UnusedImport] /home/judge/data/code/Main.nim(1, 19) Warning: imported and not used: 'complex' [UnusedImport] /home/judge/data/code/Main.nim(5, 17) Warning: imported and not used: 'strformat' [UnusedImport] /home/judge/data/code/Main.nim(5, 10) Warning: imported and not used: 'sugar' [UnusedImport] /home/judge/data/code/Main.nim(1, 76) Warning: imported and not used: 'times' [UnusedImport]
ソースコード
import algorithm, complex, macros, math, sequtils, sets, strutils, tables, timeswhen NimMajor == 0 and NimMinor <= 19:import futureelse:import sugar, strformatmacro unpack*(rhs: seq, cnt: static[int]): auto =let v = genSym(); result = quote do:(let `v` = `rhs`;())when NimMajor == 0 and 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]: lineelif T is seq[char]: line.mapIt(it[0])proc `|=`*(n: var int, m: int) = n = n or mproc `|=`*(n: var bool, m: bool) = n = n or mproc `&=`*(n: var int, m: int) = n = n and mproc `&=`*(n: var bool, m: bool) = n = n and mproc `^=`*(n: var int, m: int) = n = n xor mproc `^=`*(n: var bool, m: bool) = n = n xor mproc `%=`*(n: var int, m: int) = n = n mod mproc `/=`*(n: var int, m: int) = n = n div mproc `<<=`*(n: var int, m: int) = n = n shl mproc `>>=`*(n: var int, m: int) = n = n shr mproc `<?=`*(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)))proc newSeq4*[T](n1, n2, n3, n4: Natural): seq[seq[seq[seq[T]]]] = newSeqWith(n1, newSeqWith(n2, newSeqWith(n3, newSeq[T](n4))))# -------------------------------------------------- #let (A, B) = input(int, 2)if gcd(A, B) != 1:echo "-1"else:var cnt = newSeq[int](A * B + 1)for i in 0 .. 500:for j in 0 .. 500:if A * i + B * j > A * B: continuecnt[A * i + B * j] += 1var res = 0for i in 0 .. A * B:if cnt[i] == 0:inc resecho res