pqdong的博客

ACM数论求最小公倍数（最大公约数）模板 最大公约数：采用辗转相除法求最大公约数 最小公倍数：先将两数相乘然后除他们的最大公约数即为最小公倍数 #include<iostream> typedef long long ll; using namespace std; ll f(ll a,ll b){ ll num=a*b; ll c=a%b; ...

矩阵快速幂–Fibonacci POJ3070 题目连接 Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17587 Accepted: 12257 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1,...

2404 Super Prime（欧拉筛素数） Problem Description We all know, prime is a kind of special number which has no other factors except of 1 and itself. 2,3,5,7,11,13,17,19,23,29 are the top 20 primes. Now...

Problem Description In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 … in the same meaning. And here is the question: Suppose we have a matrix c...

2164 Bincomial Coeffcients（组合数求模） Problem Description Input Output Sample Input 3 1 1 10 2 954 723 Sample Output 1 45 3557658 解题思路： 1.em……..差点把队友坑死，第一...