Easy Question
Practice
4 (5 votes)
Very Easy
Problem
6% Success 1892 Attempts 10 Points 1s Time Limit 256MB Memory 1024 KB Max Code
This is the easiest question of the entire set. :D
Just find 6n and print last two digits.
Note : Suppose if your answer is 06 then print just 6.
Input
The first line of the input contains a single integer T (1 ≤ T≤ 10^5) — the number of test cases.
Each test case contains a single line containing single number n. ( 1 <= n <= 10^50 )
Output
Print T lines. In each line print the desired output
AUTHOR : spaul100
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:10
11 votes
Tags:
Basic MathAlgorithmsMath
Points:10
1 votes
Tags:
Basic MathMathAlgorithms
Points:10
3 votes
Tags:
MathC++Basic MathObservation
Editorial
No editorial available for this problem.