Guest
Login
Home Page
Problems
Status
Contests
Ranklist
F.A.Qs
最大公约数
Time Limit:1000MS Memory Limit:32768K
Description:
求两个正整数的最大公约数。
Input:
输入数据含有不多于50对的数据,每对数据由两个正整数(0 < n1,n2 < 2^32)组成。
Output:
对于每组数据n1和n1,计算最大公约数,每个计算结果应占单独一行。
Sample Input:
6 5 18 12
Sample Output:
1 6
Source:
qianneng
Submit Your Solution
Zhe Jiang University Of Technology Online Programming Space Beta1.3
Designed & Developped By
Jin Qiwei
.
Refactored By cb@zjut.edu.cn , QQ Group: 723311416 All Copyright Reserved 2006-
794