結果

問題 No.726 Tree Game
コンテスト
ユーザー dot_haraai
提出日時 2021-06-19 16:14:21
言語 Nim
(2.2.0)
結果
WA  
実行時間 -
コード長 1,524 bytes
コンパイル時間 4,166 ms
コンパイル使用メモリ 88,180 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-22 22:08:13
合計ジャッジ時間 4,806 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 14 WA * 11
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(1, 25) Warning: imported and not used: 'sequtils' [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(2, 18) Warning: imported and not used: 'future' [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 isPrime(n:int):bool=
  if n==1:
    return false
  if n==2:
    return true
  var d = 2 
  while d^2<=n:
    if n.mod(d)==0:
      return false
    d+=1
  return true
  

proc solve()=
  var
    y = scan()
    x = scan()
    yp = 0
    xp = 0
  for p in y+1..10^9+7:
    if isPrime(p):
      yp=p
      break
  
  for p in x+1..10^9+7:
    if isPrime(p):
      xp=p
      break
  var memo = initTable[(int,int),bool]()
  proc dfs(y,x:int):bool=
    if memo.haskey((y,x)):return memo[(y,x)]
    if y==yp or x==xp:
      return true
    else:
      result = true
      result = result and not (dfs(y+1,x))
      result = result and not (dfs(y,x+1))
      memo[(y,x)]=result
  if isPrime(y) and isPrime(x):
    echo "Second"
  elif isPrime(y):
    if dfs(y+1,x):
      echo "Second"
    else:
      echo "First"
  elif isPrime(x):
    if dfs(y,x+1):
      echo "Second"
    else:
      echo "First"
  else:
    if not dfs(y,x):
      echo "Second"
    else:
      echo "First"

  
  
solve()
0