热爱编程，热爱技术

PlantTime Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionDwarfs have planted a very interesting plant, which is a triangle direct

Fibonacci Check-upTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionEvery ALPC has his own alpc-number just like alpc12, alpc55,

Tr ATime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。 Input数据的第一

矩阵快速幂#include #include #include #include #include #include #include #include #include #define INF 99999999 #define maxn 10 using

Rightmost DigitTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a positive integer N, you should output the most right di

先介绍什么叫做欧几里德算法    有两个数 a b，现在，我们要求 a b 的最大公约数，怎么求？枚举他们的因子？不现实，当 a b 很大的时候，枚举显得那么的naïve ，那怎么做？    欧几里德有个十分又用的定理： gcd(a, b) = gcd(b , a%b) ，这样，我们就可以在几乎是 log 的时间复杂度里求解出来 a 和 b 的最大公约数了，这就是欧几里德算法，

大菲波数Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFibonacci数列，定义如下： f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacc

1.大数加法模板//大数加法模板 string add(string s1, string s2) { if(s1.length() < s2.length()) { //确保s1的位数永远大于等于s2的位数 string temp = s1; s1 = s2; s2 = temp; } int i, j; for(i=s1.length()-1, j=s2.leng

N!Time Limit:5000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N! 

利用快速幂求法，求幂int main(){int a=100,b=3;//求a^b的值，用快速幂 double  c=1,temp=b;while(a){if(a&1==1)c=temp*c ;temp*=temp;a>>=1;}cout}快速幂求模int f(int a,int b,int n){int

Integer InquiryTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionOne of the first users of BIT's new supercomputer was Chip Dill

A/BTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 639    Accepted Submission(s): 517Problem Description要求(A/B)%9973，但由于A很大，

Another kind of FibonacciTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2428    Accepted Submission(s): 963Problem DescriptionA

SegmentTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionSilen August does not like to talk with others.She like to find some

Recursive sequenceTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFarmer John likes to play mathematics games with his N cows.

纪念SlingShotTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescription已知 F（n）=3 * F（n-1）+2 * F（n-2）+7 * F（n-3），n>=3，其中F（0）=1，F（1）=3，F