Toggle navigation
万里ACM
F.A.Qs
Web Board
ProblemSet
Source/Category
Status
Ranklist
Contest
[
ProblemSet
Status
Ranklist
OI Ranklist
Statistics
]
Login
Problem E: 最大公约数与最小公倍数
Problem E: 最大公约数与最小公倍数
Time Limit:
1 Sec
Memory Limit:
128 MB
Submit:
88
Solved:
72
[
Submit
] [
Status
] [
Web Board
] [Creator:
]
Description
输入正整数A和B(A,B≤10000),计算A与B的最大公约数和最小公倍数
Sample Input
Copy
8 12 1 10000
Sample Output
Copy
4 24 1 10000