HDU1019 Least Common Multiple 就是求最小公倍数
2013-08-27 20:50
447 查看
好久没有做题啦,手都快生了,最近实在很忙乎= =
1019这题题目英文出的有点看不懂,也耽误了不少时间,后来明白点,似乎就是求很多数字的的最小公倍数,这里用了一下迭代。。
1019这题题目英文出的有点看不懂,也耽误了不少时间,后来明白点,似乎就是求很多数字的的最小公倍数,这里用了一下迭代。。
#include <stdio.h> int func(int a, int b){ if(b == 0){ return a; } return func(b, a % b); } int lcm(int a, int b){ return a / func(a,b) * b; } int a[100000]; int main(){ int n, temp; int i; scanf("%d",&n); //n组 while(n--){ int m; scanf("%d",&m); for(i = 0; i < m; i++){ scanf("%d",&a[i]); } temp = a[0]; for(i = 1; i < m; i++){ temp = lcm(temp, a[i]); } printf("%d\n",temp); } return 0; }
相关文章推荐
- HDU-1019-Least Common Multiple( 最大公约数 && 最小公倍数 && GCD )
- hdu 1019 Least Common Multiple(数论:求最小公倍数)
- hdu 1019 Least Common Multiple(几个数的最小公倍数)
- HDU1019 Least Common Multiple(求多个数的最小公倍数)
- HDU——1019Least Common Multiple(多个数的最小公倍数)
- HDU 1019 Least Common Multiple 最小公倍数 水题
- HDU 1019 Least Common Multiple(求最小公倍数)
- HDU 1019 Least Common Multiple【GCD】
- hdu 1019 least common multiple
- hdu 1019 Least Common Multiple_水题
- HDU 1019 Least Common Multiple
- hdu_1019_Least Common Multiple_201310290920
- 算法模板之欧几里得算法(HDU1019 Least Common Multiple)
- HDU - 1019 - Least Common Multiple (lcm)
- hdu_1019Least Common Multiple(最小公倍数)
- HDU 1019 Least Common Multiple 数学题解
- HDU 1019 Least Common Multiple
- Hdu 1019 Least Common Multiple
- hdu 1019 Least Common Multiple
- HDU 1019 Least Common Multiple