【九度OJ】题目1439:Least Common Multiple 解题报告
来源:互联网 发布:网上交水电费软件 编辑:程序博客网 时间:2024/06/13 04:41
【九度OJ】题目1439:Least Common Multiple 解题报告
标签(空格分隔): 九度OJ
原题地址:http://ac.jobdu.com/problem.php?pid=1439
题目描述:
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.
输入:
Input will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 … nm where m is the number of integers in the set and n1 … nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.
输出:
For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.
样例输入:
23 5 7 156 4 10296 936 1287 792 1
样例输出:
10510296
Ways
BigInteger类好!
这个题的意思很简单,其实就是求指定数字的最小公倍数。
我们可以利用上一题的经验,求出m个数的共同最小公倍数即可。
做题时一个错误的地方就是注意两层循环的嵌套,把循环变量给写错了,导致一直出错。
import java.util.*;import java.math.*;public class Main{ public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String n = scanner.nextLine(); for (int i = 0; i < Integer.parseInt(n); i++) { String line = scanner.nextLine(); String[] params = line.split(" "); BigInteger a = new BigInteger(params[1]); for (int j = 2; j < params.length; j++) { BigInteger b = new BigInteger(params[j]);//是j,不是i a = a.multiply(b).divide(a.gcd(b)); } System.out.println(a.toString()); } }}
本来以为C++的版本也会同样的容易,可是还是遇到点问题,很不爽。原因是因为结果超出了int范围。改成long long
就好了。
#include <stdio.h>long long gcd(long long a, long long b) { return b != 0 ? gcd(b, a % b) : a;}int main() { int n; while (scanf("%d", &n) != EOF) { while (n-- != 0) { int m; scanf("%d", &m); long long answer = 1; while (m-- != 0) { int temp; scanf("%d", &temp); answer = answer * temp / gcd(answer, temp); } printf("%lld\n", answer); } } return 0;}
Date
2017 年 3 月 7 日
- 【九度OJ】题目1439:Least Common Multiple 解题报告
- 九度OJ题目1439:Least Common Multiple
- 题目1439:Least Common Multiple 九度OJ
- 九度题目1439Least Common Multiple
- 【九度】题目1439:Least Common Multiple
- 九度 题目1439:Least Common Multiple
- 九度1439:Least Common Multiple
- HDU1019 Least Common Multiple 解题报告
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 题目1439:Least Common Multiple
- 九度OJ 1056--最大公约数 1439--Least Common Multiple 【辗转相除法】
- 九度OJ-1439:Least Common Multiple(相关文章尚未添加)
- 49-题目1439:Least Common Multiple
- HDU 4913 Least common multiple 解题报告(线段树)
- 题目49:Least Common Multiple
- The Basics of Configiration System -- ConfigNamespace and ConfigOption
- java使用递归,非递归方式实现二叉树的三种常见遍历方式
- Java常见异常
- cocos2dx 获取某像素点的rgba值
- 并查集详解
- 【九度OJ】题目1439:Least Common Multiple 解题报告
- js中window和document的宽高
- 经验教训:Ubuntu 14.04上安装Nvidia显卡驱动,无经验者慎行!
- 手把手Maven搭建SpringMVC+Spring+MyBatis框架(超级详细版)
- sockaddr_in结构体
- MySQL修改root密码的多种方法
- 操作系统中的进程与线程
- 18位号码身份证校验码的计算公式(c++)
- LeetCode之路——3Sum