温姑娘的博客

A Simple Math Problem Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4788    Accepted Submission(s): 2876 Problem Description Lele

Tr A Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5121    Accepted Submission(s): 3821 Problem Description A为一个方阵，则Tr A表示A的迹（就是主

Queuing Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5620    Accepted Submission(s): 2439 Problem Description Queues and Priori

1785: Transmit information 时间限制: 3 Sec  内存限制: 128 MB 提交: 2  解决: 2 [提交][状态][讨论版] 点击打开题目链接 题目描述  The Chinese people threw themselves into an all-out war of resistance against Japanese aggres

Fibonacci Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 15071   Accepted: 10581 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn =

Funny Function Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1192    Accepted Submission(s): 580 Problem Description Function Fx,ysat

题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1242 N比较大，用矩阵快速幂解决。 与POJ 3070题目一样。 AC代码： #include #include #include #include using namespace std; typedef long long LL;

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5690 解题思路： 求m个x组成的数模k后是否为c。 x(1+10^1+10^2+........+10^m-2+10^m-1) = x*(10^m-1)/9 x*(10^m - 1)/9   % k = c x*(10^m - 1)%9k = 9c 整数快速幂求解一下即可。