随笔分类 -  数学

hdu4923
摘要：Room and MoorTime Limit: 12000/6000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 557Accepted Submission(s): 159Prob... 阅读全文
posted @ 2014-08-08 09:39 我家小破孩儿 阅读(135) 评论(0) 推荐(0)
poj1905
摘要：Expanding RodsTime Limit:1000MSMemory Limit:30000KTotal Submissions:10901Accepted:2802DescriptionWhen a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expansion.When a thin rod is mounted on two solid walls and then heated, i 阅读全文
posted @ 2014-04-03 10:51 我家小破孩儿 阅读(245) 评论(0) 推荐(0)
hdu1058
摘要：Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14933Accepted Submission(s): 6494Problem 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 阅读全文
posted @ 2014-03-05 16:04 我家小破孩儿 阅读(142) 评论(0) 推荐(0)
最大的最小公倍数
摘要：最大的最小公倍数Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 175(50 users)Total Accepted: 48(38 users)Rating: Special Judge: NoDescription从小学我们就学过最小公倍数，今天这个问题也是关于最小公倍数lcm (lease common multiple)的。我们的问题是，给定一个整数n后，你需要任取三个不大于n的数，取法不限，每个数可取多个，使得取到的这三个数的最小公倍数在所有取法中是最大的。举个例子：给定的n是5。那么不大于5的可选数为1、2、3、4、5。这 阅读全文
posted @ 2014-02-18 13:54 我家小破孩儿 阅读(322) 评论(0) 推荐(0)
hdu1568
摘要：FibonacciTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2891Accepted Submission(s): 1336Problem Description2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。接下来，CodeStar决定要考考他，于是每问他一个数字 阅读全文
posted @ 2013-10-21 20:40 我家小破孩儿 阅读(157) 评论(0) 推荐(0)
BNU E. 比比谁更虎
摘要：E. 比比谁更虎Time Limit: 1000msCase Time Limit: 1000msMemory Limit: 65535KB64-bit integer IO format: %lld Java class name: MainSubmit StatusFont Size:+-beap~高，beap~帅，beap~富，beap~无烦恼。一直以来beap都是个霸气侧漏的人，所以他经常和别人比做题的速度，据说下面这个问题，他仅仅用了1分30秒便秒杀了。你能比身为“秒神”的他更虎吗？问题如下：求L到R之间的素数的个数（包括L,R)，其中0 #include #include usi. 阅读全文
posted @ 2013-10-09 21:54 我家小破孩儿 阅读(143) 评论(0) 推荐(0)
hdu4720
摘要：Naive and Silly MugglesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 216Accepted Submission(s): 153Problem DescriptionThree wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, whi 阅读全文
posted @ 2013-09-12 19:35 我家小破孩儿 阅读(145) 评论(0) 推荐(0)
hdu1060
摘要：Leftmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10997Accepted Submission(s): 4209Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of 阅读全文
posted @ 2013-08-27 12:31 我家小破孩儿 阅读(160) 评论(0) 推荐(0)