GeeksforGeeksSolution ForSchoolDomain .Below You Can Find The Solution OfBasic ,Easy ,Medium ,Hard.You Can Also Direct Submit Your Solution toGeeksforgeeksSame Problem .You Need to login then you can submit you answers

**Problem :-**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.

**Submit Your Solution :-**

**Click Here**

**Solution :-**

**#include <iostream>**

using namespace std;

int main()

{

int t;

cin>>t;

while(t--)

{

int n1,n2,c,m;

cin>>n1>>n2;

c=n1*n2;

m=c%12;

cout<<m<<endl;

}

return 0;

}

**Output:-**

## 0 Comments: