結果

問題 No.1835 Generalized Monty Hall Problem
コンテスト
ユーザー yudedako
提出日時 2022-02-21 23:15:51
言語 Scala(Beta)
(3.6.2)
結果
AC  
実行時間 900 ms / 1,000 ms
コード長 2,186 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 11,509 ms
コンパイル使用メモリ 272,500 KB
実行使用メモリ 63,340 KB
最終ジャッジ日時 2024-06-30 01:58:39
合計ジャッジ時間 26,377 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 11
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

import scala.collection.mutable
import scala.collection.mutable.ArrayBuffer
import scala.io.StdIn.*
import scala.util.chaining.*
import scala.math.*
import scala.reflect.{ClassTag, classTag}
import scala.util.*

import scala.annotation.tailrec
type Integer = BigInt
class Rational private (private var num: Integer, private var den: Integer):
  def numerator: Integer = num
  def denominator: Integer = den
  def +(other: Rational): Rational = Rational.from(num * other.den + den * other.num, den * other.den)
  def -(other: Rational): Rational = Rational.from(num * other.den - den * other.num, den * other.den)
  def *(other: Rational): Rational = Rational.from(num * other.num, den * other.den)
  def /(other: Rational): Rational = Rational.from(num * other.den, den * other.num)
  def +=(other: Rational) =
    val (n, d) = Rational.normalize(num * other.den + den * other.num, den * other.den)
    num = n
    den = d
  def -=(other: Rational) =
    val (n, d) = Rational.normalize(num * other.den - den * other.num, den * other.den)
    num = n
    den = d
  def *=(other: Rational) =
    val (n, d) = Rational.normalize(num * other.num, den * other.den)
    num = n
    den = d
  def /=(other: Rational) =
    val (n, d) = Rational.normalize(num * other.den, den * other.num)
    num = n
    den = d

object Rational:
  given Ordering[Rational] with
    override def compare(x: Rational, y: Rational) = (x - y).num.compare(0)
  private inline def normalize(num: Integer, den: Integer): (Integer, Integer) =
    val g = gcd(num.abs, den.abs)
    val sign = num.sign * den.sign
    (num.abs * sign / g, den.abs / g)

  def from(num: Integer, den: Integer): Rational =
    val (n, d) = normalize(num, den)
    Rational(n, d)
    
  def gcd(a: Integer, b: Integer): Integer =
    a.gcd(b)

@main def main =
  import Rational.given_Ordering_Rational.mkOrderingOps
  val Array(n, m, k) = readLine.split(' ').map(_.toLong)
  val notMove = Rational.from(m, n)
  val move = Rational.from(m, n) * Rational.from(m - 1, n - k - 1) + Rational.from(n - m, n) * Rational.from(m, n - k - 1)
  val max = if notMove < move then move else notMove
  println(s"${max.numerator} ${max.denominator}")
0