12 hour clock Multiplication
Submissions: 2547   Accuracy:

36.26%

  Difficulty: School   Marks: 0
*School Problem's Submission isn't counted in score!
     

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.

Input
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 .

Output
Corresponding to each test case, print the difference in a new line.

Constraints:
1 <=T <= 100
1 <= num1 <= 1000
1 <= num2 <= 1000

Example:
input
1
2 3
3 5

Output
6
3

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Aditya Garg
Author: Aditya Garg 1


Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.