Knight
Connect to the TCP Judge
Run your solver locally and connect to the judge. For each test case, send the correct output. When you clear every case, the judge prints the flag.
Sample Test Cases
1 1
0
1 2
2
| Input | Output |
|---|---|
1 1 |
0 |
1 2 |
2 |
The judge cycles through these cases (and any others configured). Return the exact output for each to earn the flag.
Problem Description
In how many ways can one white and one black knight be placed on a chessboard of dimensions NxM so that they do not threaten each other?
Login to submit a solution.
Frequently Asked Questions
This is a hard level problem worth 120 points.
This is a coding problem problem in the Coding category.
1 user have successfully solved this problem.
Related Problems
Try these similar problems to improve your skills