数学问题 - 随笔分类 - kuangbin

HDU 4423 Simple Function（数学题，2012长春D题）

摘要：Simple FunctionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 111Accepted Submission(s): 31Problem DescriptionKnowing that x can be any real number that x2+ Dx + E ≠ 0. Now, given the following function:What is the range of y?InputThe first line c 阅读全文

posted @ 2013-10-05 23:09 kuangbin 阅读(1219) 评论(0) 推荐(0)

HDU 4762 Cut the Cake （2013长春网络赛1004题，公式题）

摘要：Cut the CakeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 300Accepted Submission(s): 135Problem DescriptionMMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends HZ took some (N) strawb 阅读全文

posted @ 2013-09-29 17:30 kuangbin 阅读(1696) 评论(0) 推荐(0)

HDU 4498 Function Curve （分段，算曲线积分）

摘要：Function CurveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 31Accepted Submission(s): 10Problem DescriptionGiven sequences of k1, k2, … kn, a1, a2, …, anand b1, b2, …, bn. Consider following function:Then we draw F(x) on a xy-plane, the value of 阅读全文

posted @ 2013-08-24 18:29 kuangbin 阅读(730) 评论(4) 推荐(1)

POJ 2417 Discrete Logging （Baby-Step Giant-Step）

摘要：Discrete LoggingTime Limit:5000MSMemory Limit:65536KTotal Submissions:2819Accepted:1386DescriptionGiven a prime P, 2 8 #include 9 #include 10 #include 11 #include 12 #include 13 #include 14 #include 15 #include 16 #include 17 #include 18 #include 19 using namespace std;20 //baby_step giant_step21 .. 阅读全文

posted @ 2013-08-24 00:35 kuangbin 阅读(1643) 评论(0) 推荐(0)

HDU 4675 GCD of Sequence （2013多校7 1010题数学题）

摘要：GCD of SequenceTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 46Accepted Submission(s): 14Problem DescriptionAlice is playing a game with Bob.Alice shows N integers a1, a2, …, aN, and M, K. She says each integers 1 ≤ ai≤ M.And now Alice wants to a 阅读全文

posted @ 2013-08-13 20:12 kuangbin 阅读(1342) 评论(2) 推荐(0)

HDU 4579 Random Walk （解方程组）

摘要：Random WalkTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 81Accepted Submission(s): 35Problem DescriptionYuanfang is walking on a chain. The chain has n nodes numbered from 1 to n. Every second, he can move from node i to node j with probability:c 阅读全文

posted @ 2013-08-12 21:48 kuangbin 阅读(1288) 评论(2) 推荐(0)

HDU 4655 Cut Pieces（2013多校6 1001题简单数学题）

摘要：Cut PiecesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 133Accepted Submission(s): 62Problem DescriptionSuppose we have a sequence of n blocks. Then we paint the blocks. Each block should be painted a single color and block i can have color 1 to 阅读全文

posted @ 2013-08-08 19:15 kuangbin 阅读(938) 评论(1) 推荐(0)

HDU 4609 3-idiots（FFT）

摘要：3-idiotsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 216Accepted Submission(s): 73Problem DescriptionKing OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that it was a kind of perfo 阅读全文

posted @ 2013-07-24 14:18 kuangbin 阅读(9915) 评论(5) 推荐(1)

HDU 1402 A * B Problem Plus (FFT求高精度乘法)

摘要：A * B Problem PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9413Accepted Submission(s): 1468Problem DescriptionCalculate A * B.InputEach line will contain two integers A and B. Process to end of file.Note: the length of each integer will not 阅读全文

posted @ 2013-07-24 12:35 kuangbin 阅读(8506) 评论(0) 推荐(0)

HDU 4549 M斐波那契数列（矩阵快速幂+欧拉定理）

摘要：M斐波那契数列Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 353Accepted Submission(s): 93Problem DescriptionM斐波那契数列F[n]是一种整数数列，它的定义如下：F[0] = aF[1] = bF[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n，你能求出F[n]的值吗？Input输入包含多组测试数据；每组数据占一行，包含3个整数a, b, n（ 0 < 阅读全文

posted @ 2013-05-21 15:11 kuangbin 阅读(3227) 评论(5) 推荐(1)

K - Yet another end of the world（2013南京邀请赛K题）

摘要：K - Yet another end of the world时间限制:5000 Ms内存限制:65535 Kb问题描述In the year 3013, it has been 1000 years since the previous predicted rapture. However, the Maya will not play a joke any more and the Rapture finally comes in. Fortunately people have already found out habitable planets, and made enough a 阅读全文

posted @ 2013-05-16 22:39 kuangbin 阅读(1564) 评论(1) 推荐(0)

HDU 4535 吉哥系列故事——礼尚往来(水题，错排）

摘要：吉哥系列故事——礼尚往来Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 67Accepted Submission(s): 48Problem Description 吉哥还是那个吉哥那个江湖人称“叽叽哥”的基哥每当节日来临，女友众多的叽叽哥总是能从全国各地的女友那里收到各种礼物。有礼物收到当然值得高兴，但回礼确是件麻烦的事！无论多麻烦，总不好意思收礼而不回礼，那也不是叽叽哥的风格。现在，即爱面子又抠门的叽叽哥想出... 阅读全文

posted @ 2013-03-30 22:31 kuangbin 阅读(1047) 评论(0) 推荐(0)

ZOJ 3203 Light Bulb （数学直接推公式或者三分法）

摘要：ZOJ Problem Set - 3203Light BulbTime Limit: 1 Second Memory Limit: 32768 KBCompared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house, thinking of how to ea 阅读全文

posted @ 2012-09-27 15:37 kuangbin 阅读(2972) 评论(0) 推荐(0)

HDU 4407 Sum 第37届ACM/ICPC 金华赛区第1008题（容斥原理）

摘要：SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 358Accepted Submission(s): 109Problem DescriptionXXX is puzzled with the question below: 1, 2, 3, ..., n (1<=n<=400000) are placed in a line. There are m (1<=m<=1000) operations of two 阅读全文

posted @ 2012-09-22 22:45 kuangbin 阅读(1688) 评论(0) 推荐(0)

HDU 4291 A Short problem 第37届ACM/ICPC 成都赛区网络赛1004题（找规律，取模求循环节）

摘要：A Short problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 344Accepted Submission(s): 131Problem Description According to a research, VIM users tend to have shorter fingers, compared with Emacs users. Hence they prefer problems short, too. He.. 阅读全文

posted @ 2012-09-17 15:48 kuangbin 阅读(1620) 评论(0) 推荐(0)

HDU 4279 Number 第37届ACM/ICPC天津赛区网络赛1002题（简单规律题）

摘要：NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 640Accepted Submission(s): 207Problem Description Here are two numbers A and B (0 < A <= B). If B cannot be divisible by A, and A and B are not co-prime numbers, we define A as a special n 阅读全文

posted @ 2012-09-10 15:36 kuangbin 阅读(769) 评论(0) 推荐(0)

POJ 1850 Code（排列数组）

摘要：CodeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 6093Accepted: 2865DescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is associated to a character sequ 阅读全文

posted @ 2012-08-18 20:54 kuangbin 阅读(330) 评论(0) 推荐(0)

HDU 1041 Computer Transformation（高精度）

摘要：Computer TransformationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3845Accepted Submission(s): 1420Problem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the compu 阅读全文

posted @ 2012-08-11 22:44 kuangbin 阅读(488) 评论(0) 推荐(0)

HDU 4345 Permutation（数学题，记忆化搜索）

摘要：PermutationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 291Accepted Submission(s): 168Problem DescriptionThere is an arrangement of N numbers and a permutation relation that alter one arrangement into another.For example, when N equals to 6 the 阅读全文

posted @ 2012-08-08 21:47 kuangbin 阅读(1004) 评论(0) 推荐(0)

HDU 4349 Xiao Ming's Hope（数学题）

摘要：Xiao Ming's HopeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 433Accepted Submission(s): 290Problem DescriptionXiao Ming likes counting numbers very much, especially he is fond of counting odd numbers. Maybe he thinks it is the best way to sh 阅读全文

posted @ 2012-08-08 18:31 kuangbin 阅读(638) 评论(0) 推荐(0)

随笔分类 - 数学问题