結果

問題 No.1006 Share an Integer
ユーザー dot_haraaidot_haraai
提出日時 2021-03-30 23:27:54
言語 Nim
(2.2.0)
結果
AC  
実行時間 178 ms / 2,000 ms
コード長 946 bytes
コンパイル時間 8,228 ms
コンパイル使用メモリ 86,528 KB
実行使用メモリ 18,688 KB
最終ジャッジ日時 2024-12-01 00:05:56
合計ジャッジ時間 9,470 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 8) Warning: imported and not used: 'critbits' [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]

ソースコード

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 prepare(n=2*10^6):seq[int]=
  result = newseqwith(n+1,2)
  result[0]=0
  result[1]=1

  for i in 2..n:
    for nxt in countup(2*i,n,i):
      result[nxt]+=1


let v = prepare()
#echo v


proc solve()=
  var
    x = scan()
    minv = int.high.div(2)
  for a in 1..x.div(2):
    minv.min=abs(a-v[a]-(x-a-v[x-a]))
  for a in 1..<x:
    if abs(a-v[a]-(x-a-v[x-a]))==minv:
      echo fmt"{a} {x-a}"


  

  
solve()
0