結果

問題 No.955 ax^2+bx+c=0
コンテスト
ユーザー dot_haraai
提出日時 2021-06-13 13:02:18
言語 Nim
(2.2.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,259 bytes
コンパイル時間 5,381 ms
コンパイル使用メモリ 86,872 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-22 21:41:09
合計ジャッジ時間 8,811 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 122
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 25) Warning: imported and not used: 'sequtils' [UnusedImport]
/home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [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]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]

ソースコード

diff #
raw source code 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
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 scanbf(): BiggestFloat = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')




    
proc solve()=
  var
    a = scanbf()
    b = scanbf()
    c = scanbf()
  if a==0 and b==0:
    if c==0:
      echo -1
    else:
      echo 0
  elif a==0:
    echo 1
    echo -c/b
  else:
    if a < 0:
      a = -a
      b = -b
      c = -c
    var d = b.int^2-4*a.int*c.int
    if d==0:
      echo 1
      echo -b/(2*a)
    elif d>0:
      echo 2
      var t = newseq[float]()
      if b>0:
        t.add((-b-sqrt(d.toBiggestFloat))/(2*a))
        #echo (c/(t[0]*a))
        t.add(c/(t[0]*a))
      elif b<0:
        t.add((-b+sqrt(d.toBiggestFloat))/(2*a))
        t.add(c/(t[0]*a))
      t.sort()
      
      echo t.join("\n")
    else:
      echo 0

  
solve()
0