数论
文章平均质量分 84
jjaw2013
cheerupUSC
展开
-
HDU 2576 Another Sum Problem
传送门:Another Sum ProblemAnother Sum ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1227 Accepted Submission(s): 336P原创 2014-02-07 13:25:15 · 615 阅读 · 0 评论 -
[数论] HOJ 1356 Prime Judge Miller Rabin+快速幂
传送门:Prime JudgePrime JudgeMy Tags (Edit) Source : Unknown Time limit : 30 sec Memory limit : 32 MSubmitted : 5899, Accept原创 2014-02-09 14:26:11 · 946 阅读 · 0 评论 -
[数论] POJ 3090/HOJ 2416 Visible Lattice Points 欧拉函数
传送门:Visible Lattice PointsVisible Lattice PointsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5126 Accepted: 2978DescriptionA lattice point原创 2014-02-10 13:03:22 · 681 阅读 · 0 评论 -
[数论] HOJ 2276 Count prime 筛素数
传送门:Count primeCount primeMy Tags (Edit) Source : SCU Programming Contest 2006 Final Time limit : 1 sec Memory limit : 64 M原创 2014-02-09 15:08:57 · 763 阅读 · 0 评论 -
[数论] HDU 1431 素数回文 筛素数
传送门:素数回文素数回文Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9385 Accepted Submission(s): 2193Problem Descriptionxiaoou3原创 2014-02-09 18:02:37 · 883 阅读 · 0 评论 -
[数论] HOJ 1015 Nearly prime numbers 筛素数
传送门:Nearly prime numbersNearly prime numbersMy Tags (Edit) Source : Unknown Time limit : 1 sec Memory limit : 1 MSubmitte原创 2014-02-09 20:05:41 · 928 阅读 · 0 评论 -
[数论] HOJ 1528/ZOJ 1823 Factoring Large Numbers
传送门:Factoring Large NumbersFactoring Large NumbersTime Limit: 2 Seconds Memory Limit: 65536 KBOne of the central idea behind much cryptography is that factoring large numbers is compu原创 2014-02-09 20:33:40 · 877 阅读 · 1 评论 -
[数论] HOJ 2561 MaoLaoDa Number 筛素数
传送门:MaoLaoDa NumberMaoLaoDa NumberMy Tags (Edit) Source : MaoLaoDa Time limit : 5 sec Memory limit : 64 MSubmitted : 711,原创 2014-02-09 21:20:11 · 780 阅读 · 0 评论 -
[数论] HOJ 2947 Calculation 2 欧拉函数
传送门:Calculation 2Calculation 2My Tags (Edit) Source : GTmac Time limit : 1 sec Memory limit : 64 MSubmitted : 221, Accept原创 2014-02-10 13:19:26 · 685 阅读 · 0 评论 -
[数论]HDU 1452 Happy 2004 素因子分解+快速幂模+乘法逆元
传送门:Happy 2004Happy 2004Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 882 Accepted Submission(s): 620Problem Description原创 2014-02-10 14:19:02 · 871 阅读 · 0 评论 -
[数论]HDU 1215 七夕节 筛素数
传送门:七夕节七夕节Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26181 Accepted Submission(s): 8110Problem Description七夕节那天,月老原创 2014-02-09 12:49:26 · 779 阅读 · 0 评论 -
[数论] NEFU 2 猜想 筛素数
传送门:猜想猜想Time Limit 3000msMemory Limit 65536Kdescription哥德巴赫(Goldbach ]C.,1690.3.18~1764.11.20)是德国数学家;出生于格奥尼格斯别尔格(现名加里宁城);曾在英国牛津大原创 2014-02-09 15:59:16 · 797 阅读 · 0 评论 -
HOJ 2022 Mersenne Composite Numbers
Mersenne Composite NumbersMy Tags (Edit) Source : ACM ICPC Pacific Northwest 2004 Time limit : 1 sec Memory limit : 32 MSubmi原创 2014-02-09 22:51:18 · 706 阅读 · 0 评论 -
[数论] HOJ 1953 Relatives 欧拉函数
传送门:RelativesRelativesMy Tags (Edit) Source : Waterloo ACM Programming Contest June 1, 2002 Time limit : 1 sec Memory limit : 32 M原创 2014-02-10 12:50:29 · 679 阅读 · 0 评论 -
[数论] POJ 2689 Prime Distance 二次筛选
传送门:Prime DistancePrime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10930 Accepted: 2946DescriptionThe branch of mathematics called原创 2014-02-09 16:41:44 · 760 阅读 · 0 评论 -
[数论]POJ 1061 青蛙的约会 扩展欧几里得算法
传送门:青蛙的约会青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 85205 Accepted: 14921Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上原创 2014-02-08 15:21:52 · 873 阅读 · 0 评论 -
[数论]HOJ 2185 Min Chain 扩展欧几里得算法
传送门:Min ChainMin ChainMy Tags (Edit) Source : 2009 China North East Local Contest Time limit : 2 sec Memory limit : 64 M原创 2014-02-07 22:04:47 · 764 阅读 · 0 评论 -
[数论]POJ 3002 Jackpot 欧几里得算法
传送门:JackpotJackpotTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4160 Accepted: 1386DescriptionBill has found the perfect way to make money pla原创 2014-02-07 16:06:15 · 975 阅读 · 0 评论 -
[数论]HDOJ 1222 Wolf and Rabbit 欧几里得算法
传送门:Wolf and RabbitWolf and RabbitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4491 Accepted Submission(s): 2253Problem原创 2014-02-07 16:21:32 · 946 阅读 · 0 评论 -
[数论]HDOJ 2503 a/b + c/d 欧几里得算法
传送门:a/b + c/da/b + c/dTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7056 Accepted Submission(s): 4055Problem Description原创 2014-02-07 17:21:15 · 1020 阅读 · 0 评论 -
[数论]HDOJ 2504 又见GCD 欧几里得算法
传送门:又见GCD又见GCDTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8975 Accepted Submission(s): 3672Problem Description有三个正整原创 2014-02-07 19:05:24 · 877 阅读 · 0 评论 -
[数论]POJ 2115/HOJ 1787 C Looooops 扩展欧几里得算法
传送门:C LooooopsC LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16096 Accepted: 4138DescriptionA Compiler Mystery: We are given a C-lang原创 2014-02-07 21:04:18 · 840 阅读 · 0 评论 -
[数论]POJ 3641/HOJ 2700 Pseudoprime numbers 快速幂
传送门:Pseudoprime numbersPseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6014 Accepted: 2404DescriptionFermat's theorem states原创 2014-02-08 18:36:20 · 800 阅读 · 0 评论 -
[数论]HOJ 2901 Calculation 快速幂
传送门:CalculationCalculationMy Tags (Edit) Source : GTmac Time limit : 1 sec Memory limit : 32 MSubmitted : 346, Accepted :原创 2014-02-08 20:27:22 · 755 阅读 · 0 评论 -
[数论]HDU 4704 Sum 费马小定理
传送门:SumSumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1028 Accepted Submission(s): 462Problem Description原创 2014-02-08 21:15:11 · 664 阅读 · 0 评论 -
[数论]HOJ 2010 GCD & LCM Inverse
传送门:GCD & LCM InverseGCD & LCM InverseMy Tags (Edit) Source : HUST Monthly Contest of April Time limit : 2 sec Memory limit : 32 M原创 2014-02-08 22:01:43 · 1026 阅读 · 0 评论 -
[数论]HDU 1576 A/B 扩展欧几里得算法
传送门:A/BA/BTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1441 Accepted Submission(s): 1095Problem Description要求(A/B)%9原创 2014-02-08 12:43:45 · 752 阅读 · 0 评论 -
[数论]HDU 2669 Romantic 扩展欧几里得算法
传送门:RomanticRomanticTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2592 Accepted Submission(s): 1025Problem Description原创 2014-02-08 14:35:29 · 875 阅读 · 0 评论 -
[数论]HOJ 1842 Raising Modulo Numbers 快速幂
传送门:Raising Modulo NumbersRaising Modulo NumbersMy Tags (Edit) Source : CTU Open 1999 Time limit : 1 sec Memory limit : 32 M原创 2014-02-08 17:28:28 · 627 阅读 · 0 评论 -
[数论]HOJ 1991 Happy 2005
传送门:Happy 2005Happy 2005My Tags (Edit) Source : SCU Programming Contest 2005 Preliminary Time limit : 1 sec Memory limit : 32 M原创 2014-02-08 17:55:46 · 636 阅读 · 0 评论 -
[数论] POJ 3126 Prime Path
Prime Path原创 2014-07-14 16:24:02 · 599 阅读 · 0 评论