数论
偷吃了老鼠的土豆
戒骄戒躁,脚踏实地,坚持不懈,愈挫愈勇。
展开
-
Goldbach`s Conjecture(数论)素数筛
题目:https://vjudge.net/contest/242286#problem/AGoldbach'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,...原创 2018-07-30 16:36:40 · 482 阅读 · 0 评论 -
Chinese remainder theorem again(最小公倍数)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1788我知道部分同学最近在看中国剩余定理,就这个定理本身,还是比较简单的: 假设m1,m2,…,mk两两互素,则下面同余方程组: x≡a1(mod m1) x≡a2(mod m2) … x≡ak(mod mk) 在0<=<m1m2…mk内有唯一解。 记Mi=M/mi(1<...原创 2018-08-05 16:32:40 · 118 阅读 · 0 评论 -
Biorhythms (中国剩余定理)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1370BiorhythmsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5184 Accepted Submission(s): ...原创 2018-08-05 15:50:06 · 201 阅读 · 0 评论 -
C Looooops(扩展欧几里得)
题目:A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to value A a...原创 2018-08-01 00:07:07 · 130 阅读 · 0 评论 -
Number Sequence(斐波那契变形)
题目;A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the value of f(n). InputThe input consists o...原创 2018-07-31 20:50:27 · 400 阅读 · 0 评论 -
百度之星资格赛——Problem A (快速幂+逆元)
题目:度熊手上有一本字典存储了大量的单词,有一次,他把所有单词组成了一个很长很长的字符串。现在麻烦来了,他忘记了原来的字符串都是什么,神奇的是他竟然记得原来那些字符串的哈希值。一个字符串的哈希值,由以下公式计算得到: H(s)=∏i≤len(s)i=1(Si−28) (mod 9973)H(s)=∏i=1i≤len(s)(Si−28) (mod 9973) SiSi代表 S[i] 字符的 ...原创 2018-07-31 16:01:27 · 194 阅读 · 0 评论 -
Combinations (乘法逆元)
题目:https://vjudge.net/contest/242287#problem/AGiven n different objects, you want to take k of them. How many ways to can do it?For example, say there are 4 items; you want to take 2 of them. So, ...原创 2018-07-31 15:18:14 · 170 阅读 · 0 评论 -
Help Hanzo(区间素数筛)
题目:Amakusa, the evil spiritual leader has captured the beautiful princess Nakururu. The reason behind this is he had a little problem with Hanzo Hattori, the best ninja and the love of Nakururu. Aft...原创 2018-07-31 00:12:49 · 153 阅读 · 0 评论 -
Romantic(扩展欧几里得)
题目:The Sky is Sprite. The Birds is Fly in the Sky. The Wind is Wonderful. Blew Throw the Trees Trees are Shaking, Leaves are Falling. Lovers Walk passing, and so are You. ........................原创 2018-07-31 00:05:37 · 118 阅读 · 0 评论 -
Least Common Multiple (欧几里德算法的实现)
题目: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. In...原创 2018-07-30 22:58:50 · 242 阅读 · 0 评论 -
sigma_function(因数和)
题目:Sigma FunctionTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1336DescriptionSigma function is an interesting function in Numb...转载 2018-07-30 22:25:48 · 512 阅读 · 0 评论 -
Pairs Forming LCM (数论)质因数分解+素数筛。
题目:https://vjudge.net/contest/242286#problem/DFind the result of the following code:long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) for( int j...原创 2018-07-30 20:29:57 · 199 阅读 · 0 评论 -
七夕节(筛选法)
题目:七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!" 人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下: 数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因子有1,2,3,4,6. 你想知道你的另一半吗? Input输入数据的第一行是一个数字T(1<=T...原创 2018-07-30 19:04:37 · 145 阅读 · 0 评论 -
HDU--3579Hello Kiki(中国剩余定理非互质情况)
题目:https://vjudge.net/contest/242290#problem/DOne day I was shopping in the supermarket. There was a cashier counting coins seriously when a little kid running and singing "门前大桥下游过一群鸭,快来快来 数一数,二四六七八...原创 2018-08-05 21:10:35 · 246 阅读 · 0 评论