Please enter your email address or userHandle.
Given two positive integers num1 and num2, the task is to find the product of the two numbers on a 12 hour clock rather than a number line.
First line of the input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of a single line containing two integers separated by a space .
Corresponding to each test case, print the difference in a new line.
1 <=T <= 100
1 <= num1 <= 1000
1 <= num2 <= 1000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.