結果

問題 No.1058 素敵な数
コンテスト
ユーザー dot_haraai
提出日時 2021-03-29 19:42:37
言語 Nim
(2.2.0)
結果
AC  
実行時間 33 ms / 2,000 ms
コード長 1,218 bytes
コンパイル時間 5,358 ms
コンパイル使用メモリ 128,640 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-29 12:24:08
合計ジャッジ時間 6,239 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(2, 8) Warning: imported and not used: 'critbits' [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]

ソースコード

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 getIsPrimes(n:int):seq[bool]=
    result = newSeqWith(n+1,true)
    result[1] = false
    result[0] = false
    for i in 2..n.float.sqrt.int:
        if not result[i]:continue
        for j in countup(i*2,n,i):
            result[j] = false


    
const isPrime:seq[bool] = getIsPrimes(200000)



proc preSolve():seq[int]=
  var t = newseq[int]()
  var
    idx=10^5+1
  while t.len<100:
    while not isPrime[idx]:
      idx+=1
    t.add(idx)
    idx+=1
  result.add(1)
  for i in 0..<100:
    for j in 0..<100:
      result.add(t[i]*t[j])
  result.sort()
  result.deduplicate()
    
var v = preSolve()

#echo v[0..20]

proc solve():int=
  return v[scan()-1]
    
  

  
echo solve()
0