qq_38294039的博客

输入 有多个测试用例。每个测试用例由两个数字a和b组成（0   产量 对于每个测试用例，您应输出a ^ b的最后一位数字。   样品输入 7 66 8 800   样品输出 9 6   找到规律就很简单啊！ #include using namespace std; int

 Problem Description A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the f

1.辗转相除法 int gcd(int m,int n) { int t; while (n > 0) { t = m%n; m = n; n = t; } return m; } 2. c=min(a,b) for(int i=c;i>0;i--)    {         if((a%i==0&&b%i==0))                k=i; //k

Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest i

数学归纳法 f（x）= 5 * x ^ 13 + 13 * x ^ 5 + k * a * x f（x+1）= 5 * (x+1) ^ 13 + 13 * (x+1) ^ 5 + k * a *  (x+1)按二项式展开 f（x+1）=5*（C(13,13)X^13+C(13,12)X^12+C(13,11)X^11+......+C(13,0)）+13*(C(5,5)X^5+C(

Problem Description Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't wri