递推
defense881
Noting is impossiable!Believe in yourself!
展开
-
yt13递推Children’s Queue (大数)
Children’s Queue Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 80 Accepted Submission(s) : 19Font: Times New Roman | Verdana | Georgia原创 2014-03-31 22:26:29 · 723 阅读 · 0 评论 -
HDU yt13递推1008钥匙计数之一
钥匙计数之一 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 4Font: Times New Roman | Verdana | Georgia Font Size:原创 2014-03-30 22:35:39 · 1064 阅读 · 0 评论 -
Fractal poj 2083
C - Fractal(3.4.1)Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionA fractal is an object or quantity that displays self-similarity,原创 2014-07-16 10:29:12 · 538 阅读 · 0 评论 -
HDU 5171GTY's birthday gift
GTY's birthday gift点击打开题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 585 Accepted Submission(s): 103Problem Descripti原创 2015-02-08 13:56:02 · 621 阅读 · 0 评论 -
SDUT 2605 A^X mod P
A^X mod P点击打开题目链接Time Limit: 5000ms Memory limit: 65536K 有疑问?点这里^_^题目描述It's easy for ACMer to calculate A^X mod P. Now given seven integers n, A, K, a, b, m, P, and a function f(x原创 2015-05-05 20:19:10 · 557 阅读 · 0 评论