12 hour clock Multiplication (original) (raw)

Last Updated : 11 Nov, 2022

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.

Note: Assume the Clock starts from 0 hours to 11 hours.

Examples:

Input: Num1 = 3, Num2 = 7
Output: 9
Explanation: 3*7 = 21. The time in a 12 hour clock is 9.

Input: Num1 = 3, Num2 = 4
Output: 0

Approach: Follow the steps to solve this problem:

Note: You can skip all the steps and return (Num1*Num2) % 12 also, it also works fine.

Below is the implementation of the above approach.

C++ `

// C++ code to implement the approach

#include <bits/stdc++.h> using namespace std;

// Function to find the product of // the two numbers on a 12-hour clock int multiClock(int Num1, int Num2) { return (Num1 * Num2) % 12; }

// Driver Code int main() { int num1 = 3, num2 = 7;

// Function Call
cout << multiClock(num1, num2) << endl;

return 0;

}

Java

// Java code for the above approach import java.io.*;

class GFG {

// Driver Code public static void main (String[] args) {

int num1 = 3, num2 = 7;

// Function Call
System.out.println(multiClock(num1, num2));

return;

}

// Function to find the product of the two numbers on a 12-hour clock static int multiClock(int Num1, int Num2) { return (Num1 * Num2) % 12; }

}

// This code is contributed by ajaymakvana.

Python3

Python code to implement the approach

Function to find the product of the two numbers on a 12-hour clock

def multiClock(Num1,Num2)->int: return (Num1*Num2) % 12

Driver Code

if name == 'main': num1 = 3 num2 = 7

# Function Call
print(multiClock(num1,num2))

# This code is contributed by ajaymakvana.

C#

// C# code to implement the approach using System; class GFG {

// Function to find the product of // the two numbers on a 12-hour clock static int multiClock(int Num1, int Num2) { return (Num1 * Num2) % 12; }

// Driver code public static void Main(string[] args) { int num1 = 3, num2 = 7;

// Function Call
Console.Write(multiClock(num1, num2));

} }

// This code is contributed by code_hunt.

JavaScript

`

Time Complexity: O(1)
Auxiliary Space: O(1)