数论
tredsx
一点一点进步!
展开
-
hdu 1397 Goldbach's Conjecture
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1397Goldbach's ConjectureTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6729 Accepted S原创 2017-07-10 16:38:27 · 227 阅读 · 0 评论 -
HDU 3988 Harry Potter and the Hide Story
Harry Potter and the Hide StoryTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2934 Accepted Submission(s): 755Problem Descripti原创 2017-08-01 11:43:41 · 273 阅读 · 0 评论 -
HDU 1796 How many integers can you find
How many integers can you findTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8427 Accepted Submission(s): 2508Problem Descripti原创 2017-07-25 09:37:57 · 200 阅读 · 0 评论 -
POJ 2689 Prime Distance
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18943 Accepted: 5072DescriptionThe branch of mathematics called number theory is about pro原创 2017-08-04 09:39:14 · 187 阅读 · 0 评论 -
HDU 2710 Max Factor
Max FactorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8942 Accepted Submission(s): 2924Problem DescriptionTo improve the原创 2017-07-28 23:17:52 · 235 阅读 · 0 评论 -
HDU 2588 GCD
GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2437 Accepted Submission(s): 1253Problem DescriptionThe greatest common di原创 2017-09-03 19:39:26 · 207 阅读 · 0 评论 -
HDU 2837 Calculation
CalculationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2772 Accepted Submission(s): 673Problem DescriptionAssume that f(0原创 2017-09-04 10:53:06 · 272 阅读 · 0 评论 -
HDU 1452 Happy 2004
Happy 2004Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1906 Accepted Submission(s): 1396Problem DescriptionConsider原创 2017-08-23 10:05:39 · 235 阅读 · 0 评论 -
HDU 3823 Prime Friend
Prime FriendTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3325 Accepted Submission(s): 673Problem DescriptionBesides the or原创 2017-07-29 16:49:24 · 341 阅读 · 0 评论 -
HDU 3944 DP?
DP?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 128000/128000 K (Java/Others)Total Submission(s): 3364 Accepted Submission(s): 1066Problem DescriptionFigure 1 shows原创 2017-07-15 20:16:19 · 300 阅读 · 0 评论 -
HDU 6216 A Cubic number and A Cubic Number
A Cubic number and A Cubic NumberTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 910 Accepted Submission(s): 444Problem Descripti原创 2017-09-22 21:57:29 · 205 阅读 · 0 评论 -
POJ 3604 Professor Ben
Professor BenTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8995 Accepted: 2298DescriptionProfessor Ben is an old stubborn man teaching mathematics in原创 2017-08-31 21:02:33 · 190 阅读 · 0 评论 -
codeforces 405C Unusual Product
C. Unusual Producttime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputLittle Chris is a huge fan of linear原创 2017-07-23 14:46:23 · 273 阅读 · 0 评论 -
codeforces 214B Hometask
B. Hometasktime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputFurik loves math lessons原创 2017-07-23 11:22:23 · 290 阅读 · 0 评论 -
light oj 1341 Aladdin and the Flying Carpet
Aladdin and the Flying CarpetPDF (English)StatisticsForumTime Limit: 3 second(s)Memory Limit: 32 MBIt's said that Aladdin had to solve seven m原创 2017-07-10 19:46:22 · 296 阅读 · 0 评论 -
light oj 1234 Harmonic Number
Harmonic Number Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatus Description In mathematics, the nth harmonic number is the sum of the reciprocals原创 2017-07-11 08:51:29 · 358 阅读 · 0 评论 -
light oj 1220 Mysterious Bacteria
Mysterious Bacteria Time limit500 msMemory limit32768 kBOSLinuxDr. Mob has just discovered a Deathly Bacteria. He named it RC-01. RC-01 has a very strange reproduction s原创 2017-07-11 10:48:27 · 269 阅读 · 0 评论 -
light oj 1220 Fantasy of a Summation
Fantasy of a SummationDescriptionIf you think codes, eat codes then sometimes you may get stressed. In your dreams you may see huge codes, as I have seen once. Here is the code I saw i原创 2017-07-12 11:02:23 · 243 阅读 · 0 评论 -
light oj 1214 Large Division
Large DivisionDescriptionGiven two integers, a and b, you should check whethera is divisible by b or not. We know that an integera is divisible by an integer b if and only if there原创 2017-07-12 09:26:38 · 202 阅读 · 0 评论 -
light oj 1067Combinations
DescriptionGiven 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, you can do it 6 ways.Take原创 2017-07-13 20:14:05 · 279 阅读 · 0 评论 -
求逆元的几种方法
今天我们来探讨逆元在ACM-ICPC竞赛中的应用,逆元是一个很重要的概念,必须学会使用它。 对于正整数和,如果有,那么把这个同余方程中的最小正整数解叫做模的逆元。 逆元一般用扩展欧几里得算法来求得,如果为素数,那么还可以根据费马小定理得到逆元为。 推导过程如下 求现在来看转载 2017-07-14 08:47:20 · 649 阅读 · 0 评论 -
扩展欧几里得定理及其应用
博客原地址为:http://www.cnblogs.com/ka200812/archive/2011/09/02/2164404.html首先、扩展欧几里得定理:对于两个不全为0的整数a、b,必存在一组解x,y,使得ax+by==gcd(a,b);实现如下:int gcd(int a,int b){ int t,d; if(b==0) {转载 2017-07-15 14:54:14 · 431 阅读 · 0 评论 -
UVA 11827 Maximum GCD
Maximum GCD Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possiblepair of these integers.InputThe first line of input is an integer N (1原创 2017-07-17 14:59:48 · 407 阅读 · 0 评论 -
POJ 2992 Divisors
DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11810 Accepted: 3523DescriptionYour task in this problem is to determine the number of divisors原创 2017-07-31 02:03:54 · 217 阅读 · 0 评论 -
light oj 1197 Help Hanzo
Help HanzoTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluDescriptionAmakusa, the evil spiritual leader has captured the beautiful princess Nakururu. The reason be原创 2017-07-10 10:56:41 · 297 阅读 · 0 评论 -
codeforces 894B Ralph And His Magic Field
B. Ralph And His Magic Fieldtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRalph has a magic field which i原创 2017-11-24 21:09:18 · 252 阅读 · 0 评论