首页 > 代码库 > Lowest Common Multiple Plus(hdu2028)
Lowest Common Multiple Plus(hdu2028)
不解释。
#include<stdio.h> int gcd(unsigned x, unsigned y) { unsigned r; while ((r = x%y) != 0) { x = y; y = r; } return y; } int lcm(unsigned x, unsigned y) { unsigned d; d = gcd(x, y); return (x*y / d); } int main() { int n; char d; while (scanf_s("%d%c",&n,&d)!=EOF) { unsigned d1 = 1; for (int k = 1; k <= n; k++) { unsigned a; scanf_s("%u", &a); d1 = lcm(d1, a); } printf("%u\n", d1); } }
Lowest Common Multiple Plus(hdu2028)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。