ACM_数论 - 随笔分类(第2页) - 蔡军帅

HDU 4497 GCD and LCM（数论+容斥原理）

摘要：GCD and LCM Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2982 Accepted Submission(s): 1305 Pro 阅读全文

posted @ 2018-02-18 14:08 蔡军帅阅读(240) 评论(0) 推荐(0)

欧几里德与扩展欧几里德算法

摘要：欧几里德算法欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。基本算法：设a=qb+r，其中a，b，q，r都是整数，则gcd(a,b)=gcd(b,r)，即gcd(a,b)=gcd(b,a%b)。第一种证明： a可以表示成a = kb + r，则r = a mod b 假设d是a 阅读全文

posted @ 2018-02-16 01:29 蔡军帅阅读(240) 评论(0) 推荐(0)

HDU 2516 取石子游戏（斐波那契）

摘要：取石子游戏 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6555 Accepted Submission(s): 3961 Problem D 阅读全文

posted @ 2018-02-14 16:49 蔡军帅阅读(148) 评论(0) 推荐(0)

HDU 4586 Play the Dice（数学期望）

摘要：Play the Dice Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3648 Accepted Submission(s): 1181Sp 阅读全文

posted @ 2018-02-14 16:21 蔡军帅阅读(193) 评论(0) 推荐(0)

HDU 4762 Cut the Cake（高精度）

摘要：Cut the Cake Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1657 Accepted Submission(s): 806 Pro 阅读全文

posted @ 2018-02-14 15:45 蔡军帅阅读(114) 评论(0) 推荐(0)

HDU 4438 Hunters

摘要：Hunters Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1735 Accepted Submission(s): 1308 Problem 阅读全文

posted @ 2018-02-14 15:35 蔡军帅阅读(262) 评论(0) 推荐(0)

HDU 2201 熊猫阿波的故事

摘要：熊猫阿波的故事 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7693 Accepted Submission(s): 5826 Problem 阅读全文

posted @ 2018-02-14 14:50 蔡军帅阅读(234) 评论(0) 推荐(0)

随笔分类 - ACM_数论