結果

問題 No.751 Frac #2
ユーザー GoryudyumaGoryudyuma
提出日時 2018-11-12 22:59:33
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 963 ms / 1,000 ms
コード長 6,338 bytes
コンパイル時間 13,096 ms
コンパイル使用メモリ 279,208 KB
実行使用メモリ 65,232 KB
最終ジャッジ日時 2024-07-01 05:10:30
合計ジャッジ時間 50,941 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 916 ms
64,584 KB
testcase_01 AC 926 ms
64,940 KB
testcase_02 AC 924 ms
64,700 KB
testcase_03 AC 936 ms
64,824 KB
testcase_04 AC 937 ms
65,016 KB
testcase_05 AC 933 ms
65,068 KB
testcase_06 AC 923 ms
65,068 KB
testcase_07 AC 934 ms
64,908 KB
testcase_08 AC 925 ms
64,992 KB
testcase_09 AC 941 ms
65,012 KB
testcase_10 AC 941 ms
64,864 KB
testcase_11 AC 931 ms
64,976 KB
testcase_12 AC 923 ms
64,804 KB
testcase_13 AC 932 ms
64,948 KB
testcase_14 AC 943 ms
64,968 KB
testcase_15 AC 940 ms
64,928 KB
testcase_16 AC 947 ms
65,040 KB
testcase_17 AC 944 ms
64,920 KB
testcase_18 AC 940 ms
65,148 KB
testcase_19 AC 942 ms
64,636 KB
testcase_20 AC 942 ms
64,940 KB
testcase_21 AC 941 ms
64,976 KB
testcase_22 AC 946 ms
64,812 KB
testcase_23 AC 947 ms
65,072 KB
testcase_24 AC 944 ms
64,872 KB
testcase_25 AC 954 ms
65,108 KB
testcase_26 AC 951 ms
65,016 KB
testcase_27 AC 936 ms
65,232 KB
testcase_28 AC 942 ms
65,064 KB
testcase_29 AC 947 ms
64,460 KB
testcase_30 AC 938 ms
64,828 KB
testcase_31 AC 939 ms
65,200 KB
testcase_32 AC 949 ms
64,964 KB
testcase_33 AC 942 ms
64,980 KB
testcase_34 AC 953 ms
64,660 KB
testcase_35 AC 956 ms
64,972 KB
testcase_36 AC 963 ms
65,092 KB
testcase_37 AC 947 ms
65,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//import java.util.Scanner

import scala.collection.Searching._
import scala.annotation.tailrec
import scala.collection.mutable
import scala.collection.immutable._
import scala.io.StdIn.readLine

import java.io._
import java.nio.file.{Files, Path}
import java.util.StringTokenizer

import scala.io.Codec

/**
  * Scala implementation of a faster java.util.Scanner
  * See: http://codeforces.com/blog/entry/7018
  */

class Scanner(reader: LineNumberReader) extends Iterable[String] with AutoCloseable {
  def this(reader: BufferedReader) = this(new LineNumberReader(reader))

  def this(reader: Reader) = this(new BufferedReader(reader))

  def this(inputStream: InputStream)(implicit codec: Codec) = this(new InputStreamReader(inputStream, codec.charSet))

  def this(path: Path)(implicit codec: Codec) = this(Files.newBufferedReader(path, codec.charSet))

  def this(file: File)(implicit codec: Codec) = this(file.toPath)(codec)

  def this(str: String) = this(new StringReader(str))

  override def iterator = for {
    line <- Iterator.continually(reader.readLine()).takeWhile(_ != null)
    tokenizer = new StringTokenizer(line)
    tokens <- Iterator.continually(tokenizer).takeWhile(_.hasMoreTokens)
  } yield tokens.nextToken()

  private[this] var current = iterator

  def hasNext = current.hasNext

  @inline def next() = current.next()

  /**
    * This is different from Java's scanner.nextLine
    * The Java one is a misnomer since it actually travel to end of current line
    * This one actually does fetch the next line
    */
  def nextLine(): String = {
    val line = reader.readLine()
    current = iterator
    line
  }

  def lineNumber: Int = reader.getLineNumber

  def nextString(): String = next()

  def nextBoolean(): Boolean = next().toBoolean

  def nextByte(radix: Int = 10): Byte = java.lang.Byte.parseByte(next(), radix)

  def nextShort(radix: Int = 10): Short = java.lang.Short.parseShort(next(), radix)

  def nextInt(radix: Int = 10): Int = java.lang.Integer.parseInt(next(), radix)

  def nextLong(radix: Int = 10): Long = java.lang.Long.parseLong(next(), radix)

  def nextBigInt(radix: Int = 10): BigInt = BigInt(next(), radix)

  def nextFloat(): Float = next().toFloat

  def nextDouble(): Double = next().toDouble

  def nextBigDecimal(): BigDecimal = BigDecimal(next())

  override def close() = reader.close()
}


class IUnionFind(val size: Int) {

  private case class Node(var parent: Option[Int], var treeSize: Int)

  private val nodes = Array.fill[Node](size)(new Node(None, 1))

  def union(t1: Int, t2: Int): IUnionFind = {
    if (t1 == t2) return this

    val root1 = root(t1)
    val root2 = root(t2)
    if (root1 == root2) return this

    val node1 = nodes(root1)
    val node2 = nodes(root2)

    if (node1.treeSize < node2.treeSize) {
      node1.parent = Some(t2)
      node2.treeSize += node1.treeSize
    } else {
      node2.parent = Some(t1)
      node1.treeSize += node2.treeSize
    }
    this
  }

  def connected(t1: Int, t2: Int): Boolean = t1 == t2 || root(t1) == root(t2)

  def root(t: Int): Int = nodes(t).parent match {
    case None => t
    case Some(p) => {
      nodes(t).parent = Some(root(p))
      nodes(t).parent.get
    }
  }
}

object Main {
  def solve(sc: => Scanner): Unit = {
    val A, B = Array.fill(sc.nextInt())(sc.nextLong())
    val C = A.head * (B.zipWithIndex.filter {
      case (_, b) => b % 2 == 1
    }.map {
      A => A._1
    }.foldLeft(1L)((a, b) => a * b))
    val D = (A.tail.foldLeft(1L)((a, b) => a * b) * (B.zipWithIndex.filter {
      case (_, b) => b % 2 == 0
    }.map {
      A => A._1
    }.foldLeft(1L)((a, b) => a * b)))
    val E = gcd(math.abs(C), math.abs(D))
    if (D > 0) {
      println(C / E + " " + D / E)
    } else {
      println(-C / E + " " + -D / E)
    }
  }

  def calc(N: Long, R: Long, M: Long): Double = {
    math.sqrt(R * R - (R * 2 * ((M * 1.0 / N) - 0.5)) * (R * 2 * ((M * 1.0 / N) - 0.5))) * 2
  }

  def recursive(X: Long, primeList: Stream[Long]): Long = {
    0
  }

  def check(A: Long): Boolean = {
    if (A < 0) (check(-A)) else if (A % 10 == 0) (check(A / 10)) else (A < 10)
  }

  def shift(n: Long): Long = {
    if (n == 0) (0) else if (n == 1) (1) else (shift(n - 1) << 1)
  }

  def unShift(n: Long): Long = {
    if (n == 0) (0) else (unShift(n >> 1) + 1)
  }

  def gcd(i: Long, j: Long): Long = {
    if (i < j) (gcd(j, i)) else (if (j == 0) (i) else (gcd(j, i % j)))
  }

  def main(args: Array[String]): Unit = {
    val sc: Scanner = new Scanner(System.in)
    solve(sc)
  }
}

object Util {
  def getPermutation(begin: Long = 0): Stream[Long] =
    Stream.cons(begin, getPermutation(begin + 1))

  def getPrimeList(): Stream[Long] =
    getPrimeListRecursive(getPermutation(begin = 2))

  private def getPrimeListRecursive(A: Stream[Long]): Stream[Long] =
    Stream.cons(A.head, getPrimeListRecursive(A.tail.filter(_ % A.head != 0)))

  def fib(a: Long = 0, b: Long = 1, mod: Long = Long.MaxValue): Stream[Long] = a #:: fib(b % mod, (a + b) % mod, mod)
}

object ArabicRoman {

  type =?>[A, B] = PartialFunction[A, B]

  val codeTable = List(
    (1000, "M"), (900, "CM"), (500, "D"), (400, "CD"), (100, "C"),
    (90, "XC"), (50, "L"), (40, "XL"), (10, "X"), (9, "IX"), (5, "V"), (4, "IV"), (1, "I"))

  val arabicToRoman: (Int) =?> String = {
    case src if (src >= 1 && src <= 3999) => {

      def convert(left: Int, cont: String = "", code: List[(Int, String)] = codeTable): String = {
        val (unitVal, unitChar) = code.head
        left - unitVal match {
          case n if (n == 0) => cont + unitChar
          case n if (n > 0) => convert(n, cont + unitChar, code)
          case _ => convert(left, cont, code.tail)
        }
      }

      convert(src)
    }
  }

  val romanToArabic: (String) =?> Int = {
    case src if (Option(src).exists { s => {
      s.nonEmpty && ("""[^MDCLXVI]""".r.findFirstMatchIn(s.toUpperCase) == None)
    }
    }) => {

      def convert(left: String, cont: Int = 0, code: List[(Int, String)] = codeTable): Int = {
        val (unitVal, unitChar) = code.head
        left.splitAt(unitChar.length) match {
          case ("", _) => cont
          case (`unitChar`, tail) => convert(tail, cont + unitVal, code)
          case _ => convert(left, cont, code.tail)
        }
      }

      convert(src.toUpperCase())
    }
  }
}
0