- 博客(15)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 PE Problem 95 Amicable chains （分解因子和）
Amicable chainsProblem 95The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of thes
2016-11-25 21:26:24
427
原创 Problem 100 Arranged probability （丢番图方程）
Arranged probabilityProblem 100If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the pr
2016-11-23 15:28:13
1505
原创 PE 84 Monopoly odds (随机大模拟大富翁)
Monopoly oddsProblem 84In the game, Monopoly, the standard board is set up in the following way:GOA1CC1A2T1R1B1CH1B2B3JAILH2C1T2U1
2016-11-21 23:26:47
1534
原创 PE 96 Su Doku （数独）
Su DokuProblem 96Su Doku (Japanese meaning number place) is the name given to a popular puzzle concept. Its origin is unclear, but credit must be attributed to Leonhard Euler who invented
2016-11-21 18:53:13
592
原创 关于Pell方程及其求解技巧
Pell方程在不定方程里经常出现，解其他方程的时候最后往往归结为对某个pell方程的讨论。本文不加证明的叙述几个pell方程的结论，并讨论怎么用连分数来具体算出特定pell方程的解。Pell方程，一般是指x^2-dy^2=1.①定理1：设d是一个正整数且不是一个完全平方，则方程①有无穷多组整数解x,y.设a^2-db^2=1,a>0,b>0,是所有x>0,y>0的解中使x+y√
2016-11-13 01:17:10
11177
1
原创 PE 66 Diophantine equation（Pell方程）
Diophantine equationProblem 66Consider quadratic Diophantine equations of the form:x2 – Dy2 = 1For example, when D=13, the minimal solution in x is 6492 – 13×1802 = 1.It can be ass
2016-11-12 20:15:43
889
原创 PE 144 Investigating multiple reflections of a laser beam （计算几何）
Investigating multiple reflections of a laser beamProblem 144In laser physics, a "white cell" is a mirror system that acts as a delay line for the laser beam. The beam enters the cell, bou
2016-11-09 16:48:58
1292
原创 PE 65 Convergents of e (e的无限逼近)
Convergents of eProblem 65The square root of 2 can be written as an infinite continued fraction.√2 = 1 +12 +12 +12 +
2016-11-07 22:38:02
1097
原创 数论总结（1）
数论定理：1~n内的质数个数:nln(n)\frac{n}{ln(n)}(实际偏小,越趋近于+∞越准确,估计复杂度是够的)约数个数定理定义g(x),为x的约数个数 对于一个数i，可分解成若干质数幂次的乘积，即 i=prime[1]a∗prime[2]b∗.....i=prime[1]^a*prime[2]^b*.....g(i)=(a+1)∗(b+1)∗......g(i)=(a+1)*(b+1
2016-11-04 17:32:08
1375
1
原创 ZOJ 1111 &PE 54 oker hands（大模拟扑克）
A poker deck contains 52 cards - each card has a suit which is one of clubs, diamonds, hearts, or spades (denoted C, D, H, S in the input data). Each card also has a value which is one of 2, 3, 4, 5
2016-11-04 12:29:28
9163
原创 ACdream 1017 Fast Transportation （网络流+分层图）
Fast TransportationTime Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)Submit Statistic Next ProblemProblem DescriptionI’m working for a huge transportati
2016-11-02 23:44:19
801
原创 HDU 4007 Dave （暴力枚举）
DaveTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3944 Accepted Submission(s): 1327Problem DescriptionRecently, Dave is boring, s
2016-11-02 22:47:29
573
原创 HDU 4003 Find Metal Mineral （树形dp）
Find Metal MineralTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3510 Accepted Submission(s): 1634Problem DescriptionHumans have d
2016-11-01 22:45:42
487
空空如也
VR（Virtual Realty）所要面对的挑战有哪些? VR在未来的发展将会如何?
2016-08-03
TA创建的收藏夹 TA关注的收藏夹
TA关注的人