Tom and Jerry Chase Codechef Solution

Hello coders, today we are going to solve the Tom and Jerry Chase Codechef Solution whose Problem Code is  JERRYCHASE.

Tom and Jerry Chase Codechef Solution

Problem

In a classic chase, Tom is running after Jerry as Jerry has eaten Tom’s favourite food.

Jerry is running at a speed of X metres per second while Tom is chasing him at a speed of Y metres per second. Determine whether Tom will be able to catch Jerry.

Note that initially Jerry is not at the same position as Tom.

Input Format

• he first line of input will contain a single integer T, denoting the number of test cases.
• Each test case consists of two space-separated integers X and Y — the speeds of Jerry and Tom respectively.

Output Format

For each test case, output on a new line, YES, if Tom will be able to catch Jerry. Otherwise, output NO.

You can print each character in uppercase or lowercase. For example NO, no, No, and nO are all considered the same.

Constraints

• 1≤T≤100
• 1≤X,Y≤10

Sample 1

4
2 3
4 1
1 1
3 5

Output

YES
NO
NO
YES

Explanation:

Test case 1: Jerry is running at the speed of 2 metres per second while Tom is chasing him at the speed of 3 metres per second. Since Jerry‘s speed is less than Tom’s, Tom will eventually catch Jerry.

Test case 2: Jerry is running at the speed of 4 metres per second while Tom is chasing him at the speed of 1 metres per second. Since Jerry’s speed is higher than Tom’s, Tom will never be able to catch Jerry.

Test case 3: Jerry is running at the speed of 1 metre per second while Tom is chasing him at the speed of 1 metre per second. Since Jerry’s speed is same as that of Tom’s and both of them are not at the same position, Tom will never be able to catch Jerry.

Test case 4: Jerry is running at the speed of 3 metres per second while Tom is chasing him at the speed of 5 metres per second. Since Jerry’s speed is less than Tom’s, Tom will eventually catch Jerry.

Tom and Jerry Chase Codechef Solution in CPP

#include <iostream>
using namespace std;

int main() {
	int t; cin >> t;
	while(t--) {
	    int x, y; cin >> x >> y;
	    if (x < y) cout << "YES\n";
	    else cout << "NO\n";
	}
	return 0;
}      

Tom and Jerry Chase Codechef Solution in JAVA

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner sc=new Scanner(System.in);
		int a=sc.nextInt();
		while(a!=0)
		{
		    int b=sc.nextInt();
		    int c=sc.nextInt();
		    if(c>b)
		    System.out.println("yes");
		    else
		    System.out.println("no");
		    a--;
		}
	}
}

Tom and Jerry Chase Codechef Solution in Python

# Chase2learn
# cook your dish here
t=int(input())
for i in range (t):
    x,y=map(int,input().split())
    if y>x and y!=x:
        print("YES")
    else:
        print("NO")

Disclaimer: The above Problem (Tom and Jerry Chase) is generated by CodeChef but the solution is provided by Chase2learn. This tutorial is only for Educational and Learning purpose.