数学题
文章平均质量分 81
真的好难
因为热爱,所以才一步一步走下去。。
展开
-
2015 百度之星(资格)1004
放盘子 Accepts: 731 Submissions: 1888 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem Description小度熊喜欢恶作剧。今天他向来访者们提出一个恶俗的游戏。他和来访者们轮流往一个正多边形内放盘子。最后原创 2015-05-24 18:34:19 · 504 阅读 · 0 评论 -
cf 75 C(gcd)
链接:http://codeforces.com/problemset/problem/75/C 求出a,b的gcd c,求出c的因子,判断是否在区间中#include using namespace std;int gcd(int a,int b){ return b==0?a:gcd(b,a%b);}int arr[10000];int main(原创 2016-07-12 18:51:24 · 422 阅读 · 0 评论 -
hdu 4565(矩阵快速幂)
So Easy!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3675 Accepted Submission(s): 1194Problem Description A sequence原创 2016-06-07 13:20:06 · 283 阅读 · 0 评论 -
hdu 4291(矩阵快速幂+循环节)
A Short problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2487 Accepted Submission(s): 876Problem Description Accor原创 2016-06-07 13:18:35 · 371 阅读 · 0 评论 -
hdu 2256(矩阵快速幂)
Problem of PrecisionTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1226 Accepted Submission(s): 731Problem Description原创 2016-06-07 13:13:37 · 275 阅读 · 0 评论 -
cf 185A(矩阵快速幂)
A. Planttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDwarfs have planted a very interesting plant, whic原创 2016-05-19 21:07:32 · 637 阅读 · 0 评论 -
hdu 5667(矩阵快速幂+欧拉函数)
SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1405 Accepted Submission(s): 461Problem Description Holion A原创 2016-05-19 21:00:12 · 451 阅读 · 0 评论 -
hdu 2256(矩阵快速幂)
Problem of PrecisionTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1212 Accepted Submission(s): 726Problem Description原创 2016-05-19 20:52:24 · 239 阅读 · 0 评论 -
poj 3233(矩阵快速幂+二分)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 19323 Accepted: 8152DescriptionGiven a n × n matrix A and a positive integer k, fi原创 2016-04-15 19:50:56 · 314 阅读 · 0 评论 -
poj 3070(矩阵快速幂)
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12213 Accepted: 8668DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn原创 2016-04-14 19:14:18 · 274 阅读 · 0 评论 -
hdu 2157(矩阵快速幂)
How many ways??Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2353 Accepted Submission(s): 891Problem Description春天到了, H原创 2016-04-14 19:12:19 · 263 阅读 · 0 评论 -
hdu 5651 (组合数学 + 阶乘求逆元)
xiaoxin juju needs helpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1149 Accepted Submission(s): 329Problem Description原创 2016-03-28 21:36:09 · 1324 阅读 · 0 评论 -
hdu 1575(矩阵快速幂)
Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4088 Accepted Submission(s): 3050Problem DescriptionA为一个方阵,则Tr A表示A的迹原创 2016-04-12 14:44:09 · 241 阅读 · 0 评论 -
HDU 5461
Largest PointTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 973 Accepted Submission(s): 386Problem DescriptionGiven the原创 2015-09-23 13:26:24 · 372 阅读 · 0 评论 -
cf 432 C
链接:http://codeforces.com/problemset/problem/432/C 任意一个大于2的合数等于两个素数相加,只要知道这个定理就不难了。将每个元素的值作为下标,记录该元素所在的位置,排序的时候判断该点是否为本身,不是得话就去判断两点之间的距离是否为素数,不是变为两个素数相加即可,具体看代码#include usi原创 2016-07-12 19:01:23 · 391 阅读 · 0 评论