随笔分类 -  数论

上一页 1 2 3 4 5 下一页
hdu 2865 Polya计数+(矩阵 or 找规律 求C)
摘要：Birthday Toy Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 644 Accepted Submission(s): 326 Prob 阅读全文
posted @ 2016-04-22 10:52 Przz 阅读(258) 评论(0) 推荐(0)
Polya计数
摘要：Let it Bead Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5365 Accepted: 3585 Description "Let it Bead" company is located upstairs at 70 阅读全文
posted @ 2016-04-21 09:28 Przz 阅读(523) 评论(0) 推荐(0)
poj 2888 Magic Bracelet(Polya+矩阵快速幂)
摘要：Magic Bracelet Time Limit: 2000MS Memory Limit: 131072K Total Submissions: 4990 Accepted: 1610 Description Ginny’s birthday is coming soon. Harry Pott 阅读全文
posted @ 2016-04-19 22:44 Przz 阅读(1150) 评论(1) 推荐(1)
hdu 5667 BestCoder Round #80 矩阵快速幂
摘要：Sequence Accepts: 59 Submissions: 650 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Sequence Accepts: 59 Submission 阅读全文
posted @ 2016-04-19 09:55 Przz 阅读(371) 评论(0) 推荐(0)
扩展Lucas定理
摘要：（1）Lucas定理：p为素数，则有: （2）证明： n=(ak...a2,a1,a0)p = (ak...a2,a1)p*p + a0 = [n/p]*p+a0，m=[m/p]*p+b0其次，我们知道，对任意质数p有(1+x)^p=1+(x^p)(mod p) 。我们只要证明这个式子：C(n,m) 阅读全文
posted @ 2016-04-16 21:45 Przz 阅读(3306) 评论(0) 推荐(2)
2015 ICL, Finals, Div. 1 Ceizenpok’s formula（组合数取模，扩展lucas定理）
摘要：J. Ceizenpok’s formula time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output J. Ceizenpok’s fo 阅读全文
posted @ 2016-04-16 21:42 Przz 阅读(607) 评论(0) 推荐(0)
hdu 5656 CA Loves GCD(n个任选k个的最大公约数和)
摘要：CA Loves GCD Accepts: 64 Submissions: 535 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) CA Loves GCD Accepts: 64 阅读全文
posted @ 2016-04-03 14:37 Przz 阅读(502) 评论(0) 推荐(0)
hdu5651 xiaoxin juju needs help(逆元)
摘要：xiaoxin juju needs help Accepts: 150 Submissions: 966 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) xiaoxin juju ne 阅读全文
posted @ 2016-03-26 21:59 Przz 阅读(163) 评论(0) 推荐(0)
poj 2886 线段树+反素数
摘要：Who Gets the Most Candies? Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 12744 Accepted: 3968 Case Time Limit: 2000MS Description N chil 阅读全文
posted @ 2016-03-24 15:08 Przz 阅读(184) 评论(0) 推荐(0)
hdu 4777 树状数组+合数分解
摘要：Rabbit Kingdom Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1999 Accepted Submission(s): 689 阅读全文
posted @ 2016-03-06 15:06 Przz 阅读(252) 评论(0) 推荐(0)
poj2947 高斯消元
摘要：Widget Factory Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 5218 Accepted: 1802 Description The widget factory produces several differen 阅读全文
posted @ 2016-01-29 01:03 Przz 阅读(135) 评论(0) 推荐(0)
poj 2065 高斯消元（取模的方程组）
摘要：SETI Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 1735 Accepted: 1085 Description For some years, quite a lot of work has been put into 阅读全文
posted @ 2016-01-29 00:58 Przz 阅读(579) 评论(0) 推荐(0)
poj3185 高斯消元
摘要：The Water Bowls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5329 Accepted: 2081 Description The cows have a line of 20 water bowls from 阅读全文
posted @ 2016-01-29 00:49 Przz 阅读(180) 评论(0) 推荐(0)
poj1753 高斯消元
摘要：Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 37055 Accepted: 16125 Description Flip game is played on a rectangular 4x4 field 阅读全文
posted @ 2016-01-29 00:46 Przz 阅读(179) 评论(0) 推荐(0)
poj 1222 高斯消元
摘要：EXTENDED LIGHTS OUT Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8353 Accepted: 5400 Description In an extended version of the game Ligh 阅读全文
posted @ 2016-01-29 00:42 Przz 阅读(167) 评论(0) 推荐(0)
poj1681 高斯消元
摘要：Painter's Problem Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5352 Accepted: 2588 Description There is a square wall which is made of n 阅读全文
posted @ 2016-01-29 00:36 Przz 阅读(210) 评论(0) 推荐(0)
poj 1830 高斯消元
摘要：开关问题 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 7033 Accepted: 2713 Description 有N个相同的开关，每个开关都与某些开关有着联系，每当你打开或者关闭某个开关的时候，其他的与此开关相关联的开关 阅读全文
posted @ 2016-01-29 00:29 Przz 阅读(144) 评论(0) 推荐(0)
poj 2417 && poj3243(Baby-Step Giant-Step)
摘要：Discrete Logging Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 4624 Accepted: 2113 Description Given a prime P, 2 <= P < 231, an integer 阅读全文
posted @ 2016-01-14 22:51 Przz 阅读(159) 评论(0) 推荐(0)
hdu 4609 （FFT求解三角形）
摘要：Problem Description King OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that it was a 阅读全文
posted @ 2016-01-13 23:54 Przz 阅读(335) 评论(0) 推荐(0)
hdu 1402 FFT（模板）
摘要：A * B Problem Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16111 Accepted Submission(s): 阅读全文
posted @ 2016-01-13 23:41 Przz 阅读(150) 评论(0) 推荐(0)

上一页 1 2 3 4 5 下一页