数论、组合数学
文章平均质量分 87
1A_coder
Just for fun!
展开
-
hdu 1133 Buy the Ticket
Buy the TicketTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4185 Accepted Submission(s): 1759Problem DescriptionThe "Harry原创 2014-04-26 10:44:45 · 1009 阅读 · 0 评论 -
hdu 1028 Ignatius and the Princess III(整数划分)
整数划分问题是算法中的一个经典命题之一,有关这个问题的讲述在讲解到递归时基本都将涉及。所谓整数划分,是指把一个正整数n写成如下形式: n=m1+m2+...+mi; (其中mi为正整数,并且1 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi) 例如当n=4时,他有5个划分,{4},{3,1},{2,2},{2原创 2014-08-08 16:01:17 · 703 阅读 · 0 评论 -
hdu 4586 Play the Dice (概率+等比数列)
Play the DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1328 Accepted Submission(s): 429Special JudgeProblem Description原创 2014-10-02 09:52:26 · 1088 阅读 · 0 评论 -
poj 1426 Find The Multiple ( BFS+同余模定理)
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18390 Accepted: 7445 Special JudgeDescriptionGiven a positive integer n, write a原创 2014-10-04 23:11:07 · 817 阅读 · 0 评论 -
hdu 1204 糖果大战 (Markov Chains求期望)
糖果大战Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2336 Accepted Submission(s): 797Problem Description生日Party结束的那天晚上,剩下了一些糖果原创 2015-04-24 20:26:45 · 1005 阅读 · 0 评论 -
hdu 4465 Candy (快速排列组合 )
CandyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2115 Accepted Submission(s): 910Special JudgeProblem DescriptionLazyChil原创 2014-10-30 21:02:25 · 892 阅读 · 0 评论 -
求n!的最高位
题目描述输入一个正整数n。输出n!的最高位上的数字。输入输入一个正整数n(n不超过1000)。输出输出n!的最高位上的数字。样例输入1000样例输出4 log n!=log n+log (n-1)+...+log 1; #include#includeint main(){ int n,i转载 2013-11-01 15:10:58 · 3207 阅读 · 1 评论 -
卡特兰数
卡塔兰数卡塔兰数是组合数学中一个常出现在各种计数问题中出现的数列。由以比利时的数学家欧仁·查理·卡塔兰 (1814–1894)命名。卡塔兰数的一般项公式为 另类递归式: h(n)=((4*n-2)/(n+1))*h(n-1);前几项为 (OEIS中的数列A000108): 1, 1, 2, 5, 14, 42, 132, 429转载 2016-04-23 09:20:17 · 1311 阅读 · 0 评论 -
hdu 1576 A/B (求乘法逆元——扩展欧几里得)
A/BTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3745 Accepted Submission(s): 2869Problem Description要求(A/B)%9973,但由于A很大,我们原创 2016-04-23 11:57:45 · 485 阅读 · 0 评论 -
CF 361 E. Mike and Geometry Problem (排列组合+乘法逆元)
E. Mike and Geometry Problemtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike wants to prepare for IMO原创 2016-08-02 16:17:55 · 692 阅读 · 0 评论 -
Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)
C. Bamboo Partitiontime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputVladimir wants to modernize partitions原创 2017-08-04 12:18:22 · 362 阅读 · 0 评论 -
扩转欧几里得算法 hdu 2669 Romantic
扩转欧几里得算法是 用来在已知a,b求解一组p,q使得p*a+q*b=Gcd(a,b)(解一定存在,根据数论中的相关定理)。 因为Gcd(a,b)=Gcd(b,a%b) 所以p*a+q*b=Gcd(a,b)=Gcd(b,a%b)=p*b+q*a%b= p*b+q*(a-a/b*b)=q*a+(p-a/b*q)*b; //注意此处a/b舍去了小数位,a-a/b*b即原创 2013-12-29 21:15:03 · 1174 阅读 · 0 评论 -
hdu 2108 Shape of HDU
Shape of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4871 Accepted Submission(s): 2208Problem Description 话说上回讲到海东集团推选原创 2014-04-02 21:15:49 · 833 阅读 · 0 评论 -
poj 3252 Round Numbers
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8194 Accepted: 2865DescriptionThe cows, as you know, have no fingers or thumbs and thus are原创 2014-04-09 21:22:18 · 730 阅读 · 0 评论 -
codeforces C. Pashmak and Buses
C. Pashmak and Busestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Pashmak has been employed in a原创 2014-08-20 10:03:38 · 689 阅读 · 0 评论 -
poj 1423 Big Number
Big Numberhttp://poj.org/problem?id=1423DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you h原创 2014-01-20 11:51:52 · 870 阅读 · 0 评论 -
欧拉函数
GCD AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2260 Accepted Submission(s): 910Problem Description Do you have spen原创 2013-11-11 19:37:36 · 1026 阅读 · 0 评论 -
hdu 1757 A Simple Math Problem(矩阵快速幂)
A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2780 Accepted Submission(s): 1649Problem DescriptionLele原创 2014-09-17 20:51:01 · 812 阅读 · 0 评论 -
hdu 2604 Queuing (矩阵快速幂)
QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2773 Accepted Submission(s): 1275Problem DescriptionQueues and Priori原创 2014-09-18 20:20:27 · 1293 阅读 · 0 评论 -
hdu 4602 Partition (概率方法)
PartitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2472 Accepted Submission(s): 978Problem DescriptionDefine f(n) as th原创 2014-08-10 12:28:01 · 1274 阅读 · 0 评论 -
hdu 5015 233 Matrix (矩阵快速幂)
233 MatrixTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 749 Accepted Submission(s): 453Problem DescriptionIn our daily lif原创 2014-09-19 18:17:14 · 2375 阅读 · 0 评论 -
hdu 4920 Matrix multiplication (矩阵相乘)
Matrix multiplicationTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 445 Accepted Submission(s): 168Problem DescriptionGive原创 2014-08-05 18:32:04 · 544 阅读 · 0 评论 -
poj 1006 Biorhythms (中国剩余定理学习)
BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 113517 Accepted: 35597DescriptionSome people believe that there are three cycles in a person原创 2014-08-26 15:12:18 · 738 阅读 · 0 评论