Hackerrank – Problem Statement
A description of the problem can be found on Hackerrank.
Solution
Cats and the mouse moves with the same speed. Suppose it is by 1 on x-axis.
Lets define the difference between their positions: (cat A, mouse), (cat B, mouse).
![\[d_{am} = |a - m|\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-562f3b80c1a9eb5d5d98e6dd513262d9_l3.png "Rendered by QuickLaTeX.com")
![\[d_{bm} = |b - m|\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-c494e8af1fe3304d6228a40c3acf9adc_l3.png "Rendered by QuickLaTeX.com")
where
![\[a\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-9257e6e35d3269c35abbe174de34e5a6_l3.png "Rendered by QuickLaTeX.com")
,
![\[b\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-7929896905ce277082a25158efc4185c_l3.png "Rendered by QuickLaTeX.com")
,
![\[m\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-512e825ef0b819e196dfdaf0a506063d_l3.png "Rendered by QuickLaTeX.com")
are coordinates on
![\[x\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-9c2601179e19ecd5f28305e8c9ed83dc_l3.png "Rendered by QuickLaTeX.com")
-axis.
The results
– If
![\[d_{am} == d_{bm}\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-390516b1f2bbc7fe0e52619b862e9568_l3.png "Rendered by QuickLaTeX.com")
-> "Mouse C"
– If
![\[d_{am} \lt d_{bm}\]](https://pidanic.com/wp-content/ql-cache/quicklatex.com-c32613e84e3b79a5b35709905fdc8f20_l3.png "Rendered by QuickLaTeX.com")
-> "Cat A"
– Else -> "Cat B"
I created solution in:
All solutions are also available on my GitHub profile.
Scala
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 |
import scala.io.Source object Solution extends App { val lines = Source.stdin.getLines().toList val catsAndMouses: List[(Int, Int, Int)] = lines.tail.map(_.split(" ").map(_.toInt).toList match { case a :: b :: m :: Nil => (a, b, m) case _ => (0, 0, 0) }) catsAndMouses.foreach(cm => { val a = cm._1 val b = cm._2 val m = cm._3 val catACatchMouseSteps = (a - m).abs val catBCatchMouseSteps = (b - m).abs val result = if(catACatchMouseSteps == catBCatchMouseSteps) { "Mouse C" } else if(catACatchMouseSteps < catBCatchMouseSteps) { "Cat A" } else { "Cat B" } println(result) }) } |
Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
import java.util.*; public class CatsAndMouse { public static void main(String[] args) { Scanner stdin = new Scanner(System.in); int tests = Integer.parseInt(stdin.nextLine()); for(int i = 0; i < tests; i++) { String line = stdin.nextLine(); String[] abmString = line.split(" "); int[] abm = new int[3]; for(int j = 0; j < 3; j++) { abm[j] = Integer.parseInt(abmString[j]); } int a = abm[0]; int b = abm[1]; int m = abm[2]; int catACatchMouseSteps = Math.abs(a - m); int catBCatchMouseSteps = Math.abs(b - m); if(catACatchMouseSteps == catBCatchMouseSteps) { System.out.println("Mouse C"); } else if(catACatchMouseSteps < catBCatchMouseSteps) { System.out.println("Cat A"); } else { System.out.println("Cat B"); } } stdin.close(); } } |
Javascript
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 |
'use strict'; const processData = input => { const lines = input.split('\n'); const abms = lines.slice(1).map(line => line.split(' ').map(i => parseInt(i))); abms.forEach(abm => { const [a, b, m] = abm; const catACatchMouseSteps = Math.abs(a - m); const catBCatchMouseSteps = Math.abs(b - m); if(catACatchMouseSteps == catBCatchMouseSteps) { console.log("Mouse C"); } else if(catACatchMouseSteps < catBCatchMouseSteps) { console.log("Cat A"); } else { console.log("Cat B"); } }); }; process.stdin.resume(); process.stdin.setEncoding("ascii"); let _input = ""; process.stdin.on("data", input => _input += input); process.stdin.on("end", () => processData(_input)); |