시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
0.5 초 (추가 시간 없음) | 512 MB | 352 | 253 | 228 | 71.250% |
Given a positive integer n, find the odd integer o and the integer p such that n = o2p.
Write a program that:
The first and only line of the input contains exactly one integer n, 1 ≤ n ≤ 106.
The output should contain two integers o and p separated by a single space such that n = o2p.
24
3 3
ICPC > Regionals > Europe > Central European Regional Contest > CERC 2002 PA번