![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数学
hpugym
这个作者很懒,什么都没留下…
展开
-
hdu 整数对
Problem DescriptionGardon和小希玩了一个游戏,Gardon随便想了一个数A(首位不能为0),把它去掉一个数字以后得到另外一个数B,他把A和B的和N告诉了小希,让小希猜想他原来想的数字。不过为了公平起见,如果小希回答的数虽然不是A,但同样能达到那个条件(去掉其中的一个数字得到B,A和B之和是N),一样算小希胜利。而且小希如果能答出多个符合条件的数字,就可以得到额外的糖果。原创 2014-08-21 15:57:22 · 428 阅读 · 0 评论 -
hdu Sumsets
SumsetsTime Limit : 6000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 20 Accepted Submission(s) : 14Font: Times New Roman | Verdana | GeorgiaFo原创 2015-02-13 13:10:12 · 420 阅读 · 0 评论 -
hdu 1098
Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7031 Accepted Submission(s): 4860Problem DescriptionIgnatius原创 2015-03-19 20:14:41 · 379 阅读 · 0 评论 -
hdu 2817 A sequence of numbers
A sequence of numbersTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 47 Accepted Submission(s) : 21Font: Times New Roman | Verdana |原创 2015-03-26 15:58:24 · 329 阅读 · 0 评论 -
hdu Eddy's AC难题 数学题目 一种排列组合C(n,i)的运算
Eddy's AC难题 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 17 Accepted Submission(s) : 12Problem DescriptionEddy是个ACMer,他不仅喜欢做ACM题,而且对于原创 2015-04-23 21:00:27 · 829 阅读 · 0 评论 -
hdu 数学题目
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 4Problem DescriptionA Central Meridian (ACM) Number N is a posi原创 2015-05-01 17:42:38 · 605 阅读 · 0 评论 -
HDU1134——Game of Connections (大数乘法,除法)+ (卡特兰数列)
Game of Connections Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 14 Accepted Submission(s) : 10Problem DescriptionThis is a small but原创 2015-04-15 21:14:12 · 672 阅读 · 0 评论 -
hust Distinct Primes
素数处理,外加打表问题原创 2015-08-19 15:20:19 · 325 阅读 · 0 评论 -
hdu1027
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNow our hero finds the door to the BEelzebub feng5166. He opens the door and finds f原创 2016-03-05 11:55:54 · 336 阅读 · 0 评论 -
poj Seuence
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA seuence qof N positive integers (10 < N < 100 000), each of them less than or eq原创 2016-03-05 12:06:05 · 366 阅读 · 0 评论 -
经典 数学问题 Fibonacci Numbers
Fibonacci NumbersTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 14 Accepted Submission(s) : 6Font: Times New Roman | Verdana | Geor原创 2015-02-12 16:04:56 · 1585 阅读 · 0 评论 -
hdu 1237 简单计算其
Font Size: ← →Problem Description读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。Input测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。Output对每个测试用例原创 2014-11-06 13:41:07 · 837 阅读 · 0 评论 -
hdu Fibonacci
Problem Description2007年到来了。经过2006年一年的修炼,数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。接下来,CodeStar决定要考考他,于是每问他一个数字,他就要把答案说出来,不过有的数字太长了。所以规定超过4位的只要说出前4位就原创 2014-08-21 17:20:51 · 420 阅读 · 0 评论 -
hdu 2206 IP计算
Problem Description在网络课程上,我学到了很多有关IP的知识。IP全称叫网际协议,有时我们又用IP来指代我们的IP网络地址,现在IPV4下用一个32位无符号整数来表示,一般用点分方式来显示,点将IP地址分成4个部分,每个部分为8位,表示成一个无符号整数(因此不需要用正号出现),如192.168.100.16,是我们非常熟悉的IP地址,一个IP地址串中没有空格出现(因为要表示成原创 2014-08-13 20:09:25 · 888 阅读 · 0 评论 -
hdu 2092 整数解
Problem Description有二个整数,它们加起来等于某个整数,乘起来又等于另一个整数,它们到底是真还是假,也就是这种整数到底存不存在,实在有点吃不准,你能快速回答吗?看来只能通过编程。例如:x + y = 9,x * y = 15 ? 找不到这样的整数x和y1+4=5,1*4=4,所以,加起来等于5,乘起来等于4的二个整数为1和47+(-8)=-1,7*(-8)=-原创 2014-08-25 21:12:07 · 593 阅读 · 0 评论 -
hdu 2073 无限路
无限的路Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5588 Accepted Submission(s): 2863Problem Description甜甜从小就喜欢画图画,最近他买了一支智能画笔,原创 2014-08-14 16:12:13 · 561 阅读 · 0 评论 -
hud 3265 Examing the romms
Problem DescriptionA murder happened in the hotel. As the best detective in the town, you should examine all the N rooms of the hotel immediately. However, all the doors of the rooms are locked, a原创 2014-08-28 13:46:50 · 478 阅读 · 0 评论 -
hdu 1058
Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first原创 2014-11-11 18:20:40 · 496 阅读 · 0 评论 -
hdu 5018
Problem DescriptionIn mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relationFn = Fn-1 + Fn-2with seed values F1 = 1; F2 = 1 (sequence A000045 in OEIS).原创 2014-11-11 18:36:24 · 370 阅读 · 0 评论 -
hdu 2101
Problem DescriptionEveryone know the story that how Newton discovered the Universal Gravitation. One day, Newton walked leisurely, suddenly, an apple hit his head. Then Newton discovered the Unive原创 2014-10-10 20:56:08 · 650 阅读 · 0 评论 -
hdu 1014
Problem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere '%' is原创 2014-10-18 10:06:28 · 421 阅读 · 0 评论 -
hdu 5615 Jam's math problem
D - Jam's math problemTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionJam has a math problem. He just learned factorization. H原创 2016-03-18 21:54:23 · 416 阅读 · 0 评论