We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Functional Programming
  3. Introduction
  4. Functions or Not?
  5. Discussions

Functions or Not?

  • vestail + 2 comments

    My strange scala solution.

    object Solution {
  def main(args: Array[String]) {
    val n = io.StdIn.readInt()
    (1 to n).foreach { i =>
      val k = io.StdIn.readInt()
      val list = (1 to k).map(x => io.StdIn.readLine.split("\\s+")(0)).toList
      if (list.distinct.size == list.size) println("YES")
      else println("NO")
    }
  }
}
    • kaganasg + 0 comments

      Thanks for adding the io code, very helpful.

      Your answer is hilarious. Nice hack. And you understand it wouldn't work if you get a duplicate relation, right? Like if the test set includes (1,2),(1,2). Your function would print NO, while this describes a valid funcition. But kudos for the insight!

    • patrick_ce + 0 comments

      I used the properties of Maps.

      object Solution {

    def functionTest() : Unit = {
        val X = scala.io.StdIn.readInt()        
        val data = Iterator.continually(readLine())
        .take(X)
        .collect(_.split(" ") match
        { case Array(s1, s2) => (s1.toDouble, s2.toDouble)})
        .toList

        println(if (data.toMap.size == data.length) 
				"YES" else "NO")
    }

    def main(args: Array[String]) {
        val N = scala.io.StdIn.readInt()
        for (_ <- 1 to N) {
            functionTest
        }
    }
}