結果

問題 No.889 素数!
ユーザー GoryudyumaGoryudyuma
提出日時 2019-09-23 23:04:00
言語 Scala(Beta)
(3.4.0)
結果
WA  
実行時間 -
コード長 7,395 bytes
コンパイル時間 15,977 ms
コンパイル使用メモリ 297,948 KB
実行使用メモリ 67,184 KB
最終ジャッジ日時 2024-09-19 04:46:28
合計ジャッジ時間 74,334 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 895 ms
66,952 KB
testcase_01 AC 902 ms
66,884 KB
testcase_02 AC 869 ms
66,620 KB
testcase_03 AC 868 ms
67,096 KB
testcase_04 AC 901 ms
66,968 KB
testcase_05 AC 869 ms
66,864 KB
testcase_06 AC 863 ms
66,912 KB
testcase_07 AC 848 ms
66,668 KB
testcase_08 AC 896 ms
66,980 KB
testcase_09 AC 816 ms
64,840 KB
testcase_10 AC 882 ms
67,036 KB
testcase_11 WA -
testcase_12 AC 863 ms
66,604 KB
testcase_13 AC 872 ms
67,148 KB
testcase_14 AC 969 ms
66,944 KB
testcase_15 AC 920 ms
67,100 KB
testcase_16 AC 908 ms
66,904 KB
testcase_17 AC 885 ms
67,060 KB
testcase_18 AC 852 ms
66,712 KB
testcase_19 AC 878 ms
67,184 KB
testcase_20 AC 884 ms
67,032 KB
testcase_21 AC 899 ms
66,984 KB
testcase_22 AC 886 ms
66,892 KB
testcase_23 AC 900 ms
67,120 KB
testcase_24 AC 912 ms
67,024 KB
testcase_25 AC 888 ms
66,876 KB
testcase_26 AC 915 ms
66,768 KB
testcase_27 AC 906 ms
67,088 KB
testcase_28 WA -
testcase_29 AC 834 ms
64,820 KB
testcase_30 AC 878 ms
67,044 KB
testcase_31 AC 905 ms
66,860 KB
testcase_32 AC 905 ms
66,948 KB
testcase_33 AC 889 ms
67,084 KB
testcase_34 AC 887 ms
67,008 KB
testcase_35 AC 877 ms
66,984 KB
testcase_36 AC 884 ms
67,020 KB
testcase_37 AC 884 ms
66,852 KB
testcase_38 AC 902 ms
67,052 KB
testcase_39 AC 893 ms
67,120 KB
testcase_40 AC 887 ms
67,036 KB
testcase_41 AC 893 ms
67,028 KB
testcase_42 AC 892 ms
67,012 KB
testcase_43 AC 903 ms
66,904 KB
testcase_44 AC 905 ms
66,892 KB
testcase_45 AC 890 ms
67,020 KB
testcase_46 AC 878 ms
66,932 KB
testcase_47 AC 886 ms
67,044 KB
testcase_48 AC 903 ms
66,968 KB
testcase_49 AC 861 ms
66,784 KB
testcase_50 AC 883 ms
67,080 KB
testcase_51 AC 879 ms
67,156 KB
testcase_52 AC 893 ms
67,088 KB
testcase_53 AC 893 ms
66,832 KB
testcase_54 AC 897 ms
67,080 KB
testcase_55 AC 882 ms
67,036 KB
testcase_56 AC 877 ms
67,064 KB
testcase_57 AC 875 ms
66,824 KB
testcase_58 AC 864 ms
67,164 KB
testcase_59 AC 878 ms
66,904 KB
testcase_60 AC 879 ms
66,716 KB
testcase_61 AC 865 ms
66,924 KB
testcase_62 AC 870 ms
67,020 KB
testcase_63 AC 865 ms
67,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//import java.util.Scanner

import java.io._
import java.nio.file.Files._
import java.nio.file.Path
import java.util.StringTokenizer

import scala.collection.immutable._
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(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: Iterator[String] = 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: Boolean = current.hasNext

  @inline def next(): String = 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(): Unit = 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)(Node(None, treeSize = 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 N = sc.nextLong()
    println(N match {
      case 6 => "Kanzensu!"
      case 28 => "Kanzensu!"
      case i if (2L to 8L).map(x => x * x).contains(i) => "Heihosu!"
      case i if (2L to 8L).map(x => x * x * x).contains(i) => "Heihosu!"
      case i if Util.getPrimeList.takeWhile(x => x <= 64L).contains(i) => "Sosu!"
      case i => i
    })
  }

  def recursive(A: Long, B: Long, X: Long): Long = {
    if (X == 0) 0 else {
      val C1 = A / X * (X / 2)
      val C2 = Math.max(A % X - X / 2 + 1, 0L)
      val C3 = C1 + C2
      val D1 = B / X * (X / 2)
      val D2 = Math.max(B % X - X / 2 + 1, 0L)
      val D3 = D1 + D2

      recursive(A, B, (if (A / X == 0 && B / X == 0) 0 else X * 2)) * 2 + Math.abs(C3 - D3) % 2
    }
  }

  def time(s: String): Int =
    s.substring(0, 2).toInt * 60 + s.substring(3, 5).toInt

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

  def calc(A: Array[Long]): Array[String] = {
    if (A.length == 0) Array.fill(0)("")
    else {
      val last = A.zipWithIndex.map(x => (x._1 - x._2, x._1)).takeWhile(x => x._1 == A.head).last._2
      if (last == A.head) "%d".format(A.head) +: calc(A.zipWithIndex.map(x => (x._1 - x._2, x._1)).dropWhile(x => x._1 == A.head).map(x => x._2))
      else "%d-%d".format(A.head, last) +: calc(A.zipWithIndex.map(x => (x._1 - x._2, x._1)).dropWhile(x => x._1 == A.head).map(x => x._2))
    }
  }

  var memo: Map[(Long, Long), Long] = Map[(Long, Long), Long]()


  def recursive2(X: Set[Long], Y: Stream[Long]): Long = if (X.contains(Y.head)) X.size else recursive2(X + Y.head, Y.tail)

  def check(i: Int, X: String): Long = {
    if (X == "") 0 else check(i, X.tail) * i + X.head.toString.toLong
  }

  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
  }

  @scala.annotation.tailrec
  def gcd(i: Long, j: Long): Long = {
    if (i < j) gcd(j, i)
    else if (j == 0) i
    else gcd(j, i % j)
  }

  def primeFactors(i: Long): List[Long] = primeFactors_(i, 1).sorted


  def primeFactors_(i: Long, j: Long): List[Long] = {
    if (j * j > i) List.empty else if (i % j == 0) primeFactors_(i, j + 1) ++ List[Long](j, i / j) else primeFactors_(i, j + 1)
  }

  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).isEmpty
    }
    } =>

      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