結果

問題 No.1140 EXPotentiaLLL!
ユーザー dot_haraaidot_haraai
提出日時 2021-03-26 22:06:48
言語 Nim
(2.0.2)
結果
RE  
実行時間 -
コード長 1,065 bytes
コンパイル時間 6,941 ms
コンパイル使用メモリ 193,736 KB
実行使用メモリ 11,256 KB
最終ジャッジ日時 2024-05-06 15:40:16
合計ジャッジ時間 11,875 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc getIsPrime(n:int):seq[bool]=
  result = newseqwith(n+1,true)
  result[0]=false
  result[1]=false
  var
    d = 2
    m = 2

  while d^2<=n:
    if result[d]:
      m = 2
      while d*m<=n:
        result[d*m]=false
        m+=1
    d+=1

      

const isPrime = getIsPrime(5*10^5)


proc solve()=
  var
    t = scan()
    ap = newseqwith(t,(scan(),scan()))
  for (a,p) in ap:
    if not isPrime[p]:
      echo -1
    else:
      if a.mod(p)==0 or p.mod(a)==0:
        echo  0
      else:
        echo  1





  
    

  
solve()
0