01 2016 档案

hdu 1806 RMQ
摘要：Frequent values Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1459 Accepted Submission(s): 535 阅读全文
posted @ 2016-01-29 05:10 Przz 阅读(239) 评论(0) 推荐(0)
hdu 4417 划分树
摘要：Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4041 Accepted Submission(s): 1862 Pr 阅读全文
posted @ 2016-01-29 03:09 Przz 阅读(176) 评论(0) 推荐(0)
hdu 3473 划分树
摘要：Minimum Sum Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3611 Accepted Submission(s): 829 Pr 阅读全文
posted @ 2016-01-29 01:24 Przz 阅读(240) 评论(0) 推荐(0)
hdu 4251 划分树
摘要：The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1155 Accepted Submi 阅读全文
posted @ 2016-01-29 01:17 Przz 阅读(206) 评论(0) 推荐(0)
hdu 2665 划分树
摘要：Kth number Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7616 Accepted Submission(s): 2402 Pr 阅读全文
posted @ 2016-01-29 01:14 Przz 阅读(151) 评论(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 阅读(209) 评论(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)
hdu 3939(勾股+容斥)
摘要：题意： 给定一个整数L(L<=1e12)，计算(x,y,z)组的个数。其中x<y<z，x^2+y^2=z^2，gcd(x,y)==1,gcd(x,z)==1,gcd(y,z)==1。 思路： 以下的方法可用来找出勾股数。设m>n 、 m 和 n 均是正整数， a = m^2-n^2 b = 2mn 阅读全文
posted @ 2016-01-05 23:15 Przz 阅读(166) 评论(0) 推荐(0)
poj 1845 （逆元 + 约数和）
摘要：题意： 求A^B的所有约数（即因子）之和，并对其取模 9901再输出。 思路： A可以表示为A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn) 其中pi均为素数 那么A的所有因子之和可以表示成 S = (1+p1+p1^2+p1^3+...p1^k1) * (1+p2+p2 阅读全文
posted @ 2016-01-05 00:10 Przz 阅读(226) 评论(0) 推荐(0)
hdu 5607 BestCoder Round #68 (矩阵快速幂)
摘要：graph Accepts: 9 Submissions: 61 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Time Limit: 8000/4000 MS (Java/Other 阅读全文
posted @ 2016-01-04 23:59 Przz 阅读(202) 评论(0) 推荐(0)