浏览器标题切换
浏览器标题切换end
摘要: Mathematically some problems look hard. But with the help of the computer, some problems can be easily solvable. In this problem, you will be given tw 阅读全文
posted @ 2019-08-13 15:58 抓水母的派大星 阅读(189) 评论(0) 推荐(0) 编辑
摘要: 1 int degree_in_fact(int n, int x)//求n!中素数x的次数 2 {3 if(m) 4 return degree_in_fact(n/x,x)+n/x; 5 return 0; 6 } 阅读全文
posted @ 2019-08-13 11:17 抓水母的派大星 阅读(142) 评论(0) 推荐(0) 编辑
摘要: 昨天了解到,原来scanf输入也会超时。。。真的还有好多需要学习的。 由于暂时遇不到几百万的输入量,所以暂时没法总结自己的经验。 先放着等遇到题目再回过头来总结。 https://blog.csdn.net/qingshui23/article/details/51077914 https://ww 阅读全文
posted @ 2019-08-13 11:09 抓水母的派大星 阅读(110) 评论(0) 推荐(0) 编辑
摘要: A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24 阅读全文
posted @ 2019-08-12 21:21 抓水母的派大星 阅读(196) 评论(0) 推荐(0) 编辑
摘要: 输入N求N的阶乘的10进制表示的长度。例如6! = 720,长度为3。 输入N求N的阶乘的10进制表示的长度。例如6! = 720,长度为3。 输入N求N的阶乘的10进制表示的长度。例如6! = 720,长度为3。 输入 第1行:一个数T,表示后面用作输入测试的数的数量。(1 <= T <= 100 阅读全文
posted @ 2019-08-12 17:18 抓水母的派大星 阅读(154) 评论(0) 推荐(0) 编辑
摘要: You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For e 阅读全文
posted @ 2019-08-11 17:11 抓水母的派大星 阅读(153) 评论(0) 推荐(0) 编辑
摘要: Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states: Every even integer, greater than 2 阅读全文
posted @ 2019-08-10 09:32 抓水母的派大星 阅读(149) 评论(0) 推荐(0) 编辑
摘要: 埃氏筛法 欧拉筛法 阅读全文
posted @ 2019-08-10 09:07 抓水母的派大星 阅读(127) 评论(0) 推荐(0) 编辑
摘要: It's said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summons a powerful Genie. Here we are concerned about the fi 阅读全文
posted @ 2019-08-09 19:23 抓水母的派大星 阅读(164) 评论(0) 推荐(0) 编辑
摘要: In mathematics, the nth harmonic number is the sum of the reciprocals of the first n natural numbers: In this problem, you are given n, you have to fi 阅读全文
posted @ 2019-08-09 14:37 抓水母的派大星 阅读(144) 评论(0) 推荐(0) 编辑