- 博客(8)
- 收藏
- 关注
原创 HDU 5176 The Experience of Love(带权并查集)
The Experience of Love Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 309 Accepted Submission(s): 119 Problem Description A gir
2015-02-20 17:06:57 524
原创 HDU 5171(矩阵快速幂)
GTY's birthday gift Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 567 Accepted Submission(s): 238 Problem Description FFZ's bi
2015-02-12 22:51:27 601
原创 poj 3070(矩阵快速幂)
Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9960 Accepted: 7103 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn
2015-02-12 14:55:53 621
原创 快速幂
问题:求(x^n)%mod (n 模板: code_1: #include typedef long long ll; ll mod_pow(ll x, ll n, ll mod) { ll res = 1; while(n > 0) { if(n & 1) res = res*x%mod; //如果二进制最低位为1,则乘上x^(2^i)
2015-02-10 17:26:40 579
原创 区间内素数的个数
给定整数a和b,请问区间[a,b)内有多少个素数? 限制条件:①a 输入:22 37 输出:3(23、23、31共3个素数) 输入:a=22801763489, b=22801787297 输出:1000 分析: b以内的合数的最小质因数一定不超过√b。如果有√b以内的素数表的话,就可以把埃氏筛法运用在[a,b)上了。也就是说,先分别做好[2,√b)
2015-02-10 15:29:23 2869
原创 poj 1182 食物链(并查集)
食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 48054 Accepted: 14008 Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都
2015-02-09 13:00:02 4039 12
原创 HDU 5167 (dfs || STL)
Fibonacci Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1360 Accepted Submission(s): 336 Problem Description Following is the
2015-02-08 22:34:24 666
原创 Sum It Up(HDU 1258)
Sum It Up Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4416 Accepted Submission(s): 2285 Problem Description Given a specified total t
2015-02-01 12:20:02 651
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人