Tom And Jerry 1 - Problem | Code Chef || Daily Coding Problem || Java Code ||
Hello and welcome to Today's video . . . Problem - Tom And Jerry 1 Problem code - TANDJ1 Problem level - Easy Platform - Code Chef Problem Statement : There is a grid of size 10^5 x 10^5 , covered completely in railway tracks. Tom is riding in a train, currently in cell (a,b), and Jerry is tied up in a different cell (c,d), unable to move. The train has no breaks. It shall move exactly K steps, and then its fuel will run out and it shall stop. In one step, the train must move to one of its neighboring cells, sharing a side. Tom can’t move without the train, as the grid is covered in tracks. Can Tom reach Jerry’s cell after exactly K steps? Note: Tom can go back to the same cell multiple times. . . . Problem link: https://www.codechef.com/LP1TO201/problems/TANDJ1?tab=statement . Thanks 4 watching
Hello and welcome to Today's video . . . Problem - Tom And Jerry 1 Problem code - TANDJ1 Problem level - Easy Platform - Code Chef Problem Statement : There is a grid of size 10^5 x 10^5 , covered completely in railway tracks. Tom is riding in a train, currently in cell (a,b), and Jerry is tied up in a different cell (c,d), unable to move. The train has no breaks. It shall move exactly K steps, and then its fuel will run out and it shall stop. In one step, the train must move to one of its neighboring cells, sharing a side. Tom can’t move without the train, as the grid is covered in tracks. Can Tom reach Jerry’s cell after exactly K steps? Note: Tom can go back to the same cell multiple times. . . . Problem link: https://www.codechef.com/LP1TO201/problems/TANDJ1?tab=statement . Thanks 4 watching