[BOJ 15372] A Simple Problem.
View as PDF
Submit solution
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text
Points:
1
Time limit:
3.0s
Memory limit:
512M
Problem types
Allowed languages
Given a positive integer N, what is the minimum positive integer K such that K is a multiple of the square of N?</p>
Note that a is a multiple of b if a = b · k for some integer k.
입력 형식
The first line of input will contain a single integer T, the number of test cases.</p>
Each test case consists of a single line, containing the integer N.
Constraints
- 1 ≤ T ≤ 200000
- 1 ≤ N ≤ 200000
For each test case, output a single line containing the integer K, the answer for that test case.
예제 입력
1
1
예제 출력
1
Comments