NYOJ--517--最小公倍数(大数打表)
最小公倍数
- 描述
-
为什么1小时有60分钟,而不是100分钟呢?这是历史上的习惯导致。但也并非纯粹的偶然:60是个优秀的数字,它的因子比较多。事实上,它是1至6的每个数字的倍数。即1,2,3,4,5,6都是可以除尽60。我们希望寻找到能除尽1至n的的每个数字的最小整数m.
- 输入
- 多组测试数据(少于500组)。
每行只有一个数n(1<=n<=100). - 输出
- 输出相应的m。
- 样例输入
-
2 3 4
- 样例输出
-
2 6 12
//打表 import java.math.BigDecimal; import java.math.BigInteger; import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner cin = new Scanner(System.in); /*final int MAX = 105; int arr[] = new int[MAX]; BigInteger res[] = new BigInteger[MAX]; for(int i=1; i<MAX; ++i)arr[i] = i; for(int i=2; i<MAX; ++i){ for(int j=i+1; j<MAX; ++j){ if(j%i == 0) arr[j] /= arr[i]; } } for(int i=1; i<MAX; ++i)res[i] = BigInteger.ONE; for(int i=2; i<MAX; ++i){ for(int j=2; j<i; ++j){ res[i] = res[i].multiply(BigInteger.valueOf(arr[j])); } } for(int i=1; i<101; ++i){ int n = i; System.out.println("\""+res[n+1] + "\","); }*/ String s[] = { "1", "2", "6", "12", "60", "60", "420", "840", "2520", "2520", "27720", "27720", "360360", "360360", "360360", "720720", "12252240", "12252240", "232792560", "232792560", "232792560", "232792560", "5354228880", "5354228880", "26771144400", "26771144400", "80313433200", "80313433200", "2329089562800", "2329089562800", "72201776446800", "144403552893600", "144403552893600", "144403552893600", "144403552893600", "144403552893600", "5342931457063200", "5342931457063200", "5342931457063200", "5342931457063200", "219060189739591200", "219060189739591200", "9419588158802421600", "9419588158802421600", "9419588158802421600", "9419588158802421600", "442720643463713815200", "442720643463713815200", "3099044504245996706400", "3099044504245996706400", "3099044504245996706400", "3099044504245996706400", "164249358725037825439200", "164249358725037825439200", "164249358725037825439200", "164249358725037825439200", "164249358725037825439200", "164249358725037825439200", "9690712164777231700912800", "9690712164777231700912800", "591133442051411133755680800", "591133442051411133755680800", "591133442051411133755680800", "1182266884102822267511361600", "1182266884102822267511361600", "1182266884102822267511361600", "79211881234889091923261227200", "79211881234889091923261227200", "79211881234889091923261227200", "79211881234889091923261227200", "5624043567677125526551547131200", "5624043567677125526551547131200", "410555180440430163438262940577600", "410555180440430163438262940577600", "410555180440430163438262940577600", "410555180440430163438262940577600", "410555180440430163438262940577600", "410555180440430163438262940577600", "32433859254793982911622772305630400", "32433859254793982911622772305630400", "97301577764381948734868316916891200", "97301577764381948734868316916891200", "8076030954443701744994070304101969600", "8076030954443701744994070304101969600", "8076030954443701744994070304101969600", "8076030954443701744994070304101969600", "8076030954443701744994070304101969600", "8076030954443701744994070304101969600", "718766754945489455304472257065075294400", "718766754945489455304472257065075294400", "718766754945489455304472257065075294400", "718766754945489455304472257065075294400", "718766754945489455304472257065075294400", "718766754945489455304472257065075294400", "718766754945489455304472257065075294400", "718766754945489455304472257065075294400", "69720375229712477164533808935312303556800", "69720375229712477164533808935312303556800", "69720375229712477164533808935312303556800", "69720375229712477164533808935312303556800", }; while(cin.hasNext()){ int n = cin.nextInt(); System.out.println(s[n-1]); } } }
NYOJ--517--最小公倍数(大数打表)的更多相关文章
- nyoj 517 最小公倍数 【java睑板】
我写了一个gcd TL该.然后调用math内gcd,AC该... 思维:它是采取n前面的最小公倍数和n求 1~n的最小公倍数 代码: import java.util.Scanner; import ...
- ural 1109,NYOJ 239,匈牙利算法邻接表
NYOJ 239:http://acm.nyist.net/JudgeOnline/problem.php?pid=239 ural 1109 :http://acm.timus.ru/problem ...
- HDU 1023 Train Problem II 大数打表Catalan数
一个出栈有多少种顺序的问题.一般都知道是Catalan数了. 问题是这个Catalan数非常大,故此须要使用高精度计算. 并且打表会速度快非常多.打表公式要熟记: Catalan数公式 Cn=C(2n ...
- nyoj 26-孪生素数问题(打表)
26-孪生素数问题 内存限制:64MB 时间限制:3000ms Special Judge: No accepted:10 submit:43 题目描述: 写一个程序,找出给出素数范围内的所有孪生素数 ...
- NYOJ题目28大数阶乘
-------------------------------------祭出BigInteger AC代码: import java.math.BigInteger; import java.uti ...
- Computer Transformation(规律,大数打表)
Computer Transformation Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/ ...
- 2019南昌邀请赛 C. Angry FFF Party 大数矩阵快速幂+分类讨论
题目链接 https://nanti.jisuanke.com/t/38222 题意: 定义函数: $$F(n)=\left\{\begin{aligned}1, \quad n=1,2 \\F(n- ...
- hdu 4002 欧拉函数 2011大连赛区网络赛B
题意:求1-n内最大的x/phi(x) 通式:φ(x)=x*(1-1/p1)*(1-1/p2)*(1-1/p3)*(1-1/p4)…..(1-1/pn),其中p1, p2……pn为x的所有质因数,x是 ...
- Buy the Ticket(卡特兰数+递推高精度)
Buy the Ticket Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Tota ...
随机推荐
- Transparent Application Failover 透明应用切换
官方文档地址 http://docs.oracle.com/cd/E11882_01/network.112/e41945/advcfg.htm#NETAG455 About Transparent ...
- jeecg关闭当前iframe
关闭当前iframe function closeDialog(){ frameElement.api.close();//本方法也行 //或者下面的方式 var win = frameElement ...
- 数据的ID名生成新的引用索引树
<?php $arr= [ '0'=>[ "id"=>2, "name"=>"建材", "pid" ...
- mysql 修改表结构的字段名
alter table domains change STATUS status tinyint(1) not null;
- 【LeetCode】67. Add Binary
题目: Given two binary strings, return their sum (also a binary string). For example,a = "11" ...
- 一张图告诉你angular2所有知识点
忙活了半年,从angular2.0到现在angular4.2.从没AOT到有AOT.我想说,angular2的学习曲线真的有点陡峭.只能说,angular2是一个比较完整的框架,框架就是这样,一大堆条 ...
- Oracle数据库中的重要对象
数据库中的重要对象:表.视图.序列.函数.存储过程.索引.同义词1.表:用PL/SQL Developer 软件打开 Scott的DEPT表查看SQL,可以看见DEPT表创建的脚本-- Create ...
- Tomcat学习笔记(一)一个简单的Web服务器
内容为<深入剖析Tomcat>第一章重点,以及自己的总结,如有描述不清的,可查看原书. 一.HTTP协议: 1.定义:用于服务器与客户端的通讯的协议,允许web服务器和浏览器通过互联网进行 ...
- 原生封装ajax
01.声明一个全局变量 02.开始封装,判断参数 03.属性的var自定义 04.请求 01.请求行 02.请求头 03.请求发送 05.响应 01.事件监听onreadystatechange 02 ...
- python的高级应用
记录一下Python函数式编程,高级的几个BIF,高级官方库方面的用法和心得. 函数式编程 函数式编程是使用一系列函数去解决问题,按照一般编程思维,面对问题时我们的思考方式是"怎么干&quo ...