HDU 1019 Least Common Multiple【gcd+lcm+水+多个数的lcm】
2024-08-24 20:15:02
Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 53016 Accepted Submission(s): 20171
Problem Description
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.
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
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.
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.
Output
For
each problem instance, output a single line containing the
corresponding LCM. All results will lie in the range of a 32-bit
integer.
each problem instance, output a single line containing the
corresponding LCM. All results will lie in the range of a 32-bit
integer.
Sample Input
2
3 5 7 15
6 4 10296 936 1287 792 1
Sample Output
105
10296
Source
分析:多个数的最小公倍数,直接每次对两个进行lcm操作就好了,具体代码如下:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll gcd(ll a,ll b)
{
return b==?a:gcd(b,a%b);
}
inline ll lcm(ll a,ll b)
{
return a*b/gcd(a,b);
}
ll a[];
int main()
{
ll n;
while(scanf("%lld",&n)!=EOF)
{
while(n--)
{
ll m;
scanf("%lld",&m);
for(ll i=;i<=m;i++)
scanf("%lld",&a[i]);
for(ll i=;i<=m-;i++)
a[i+]=lcm(a[i],a[i+]);
printf("%lld\n",a[m]);
}
}
return ;
}
最新文章
- Git(远程仓库:git@oschina)-V2.0
- 实验mongodb使用gridfs存放一个大文件
- hdu5000 背包dp
- UPDATE INNER JOIN 两表联合更新
- activiti自定义流程之自定义表单(三):表单列表及预览和删除
- [ASP.NET MVC] 利用动态注入HTML的方式来设计复杂页面
- Java多线程并发
- CSS特殊性
- poj 1659 Frogs&;#39; Neighborhood (度序列)
- hdu1044
- Led控件
- Python os.walk的用法与举例
- GCD 信号量 dispatch_semaphore_t
- Hyperledger Fabric 1.0 从零开始(二)——环境构建(公网)
- HttpClient post提交数据,返回json
- HttpWebRequest post 请求超时问题
- 关于requests库中文编码问题
- 设计模式教程(Design Patterns Tutorial)笔记之三 行为型模式(Behavioral Patterns)
- 通过Metasploit生成各种后门
- windows下redis启动失败提示maxheap flag
热门文章
- 【java】内存流:java.io.ByteArrayInputStream、java.io.ByteArrayOutputStream、java.io.CharArrayReader、java.io.CharArrayWriter
- SAP RFC介绍:关于sRFC,aRFC,tRFC,qRFC和bgRFC
- Java I/O---Reader &; Writer(字符流)
- Docker(十一):Docker实战部署HTTPS的Tomcat站点
- 闲来无事做了一个批处理的win10账号管理
- Illustration of Git branching and merge
- UWP TextBox私人定制
- 解析JSON的两种方法eval()和JSON.parse()
- Java 字符编码与解码
- Layout 不可思议(二)—— 两侧定宽的三列布局