快速幂
文章平均质量分 89
豫帝哥哥
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
展开
-
HDOJ A sequence of numbers 2817
A sequence of numbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3994 Accepted Submission(s): 1224Problem DescriptionXinlv wr原创 2015-03-25 17:27:16 · 650 阅读 · 0 评论 -
HDOJ Sum 4704【费马小定理+快速幂】
SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1866 Accepted Submission(s): 770Problem Description Sample I原创 2015-07-27 11:55:15 · 747 阅读 · 0 评论 -
UVA Leading and Trailing 11029【数学+快速幂】
11029 - Leading and TrailingTime limit: 3.000 secondsApart from the novice programmers, all others know that you can’t exactly represent numbers raisedto some high power. For example, the C fu原创 2015-08-18 14:19:04 · 874 阅读 · 0 评论 -
HDOJ 2^x mod n = 1 1395
2^x mod n = 1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13630 Accepted Submission(s): 4213Problem DescriptionGive a number n原创 2015-04-07 12:43:33 · 613 阅读 · 0 评论 -
HDOJ A hard puzzle 1097(快速幂)
A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33174 Accepted Submission(s): 11881Problem Descriptionlcy gives a ha原创 2015-04-17 00:17:05 · 565 阅读 · 0 评论 -
HDOJ Pupu 3003【快速幂】
PupuTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1409 Accepted Submission(s): 539Problem DescriptionThere is an island called原创 2015-07-27 09:23:06 · 725 阅读 · 0 评论 -
HDOJ M斐波那契数列 4549【矩阵快速幂+快速幂+费马小定理+欧拉函数】
M斐波那契数列Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2096 Accepted Submission(s): 596Problem DescriptionM斐波那契数列F[n]是一种整数数列,原创 2015-08-15 17:22:52 · 1117 阅读 · 0 评论 -
【矩阵快速幂】HDOJ graph 5607
graph Accepts: 9 Submissions: 61 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionIn a directed graph which has NN原创 2016-01-05 13:39:45 · 1038 阅读 · 0 评论