David_Jett

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1098题意：    求针对输入的k，能否找到一个最小的a，使得当x取任意自然数时，f(x)=5*x^13+13*x^5+k*a*x始终能被65整除。我的解法：   取f(1),f(2)两个特殊值得。   1.       5+13+k*a=65*T1  ->> k*a=47+65*T

链接：http://acm.zjut.edu.cn/onlinejudge/problem.php?cid=1101&pid=2 题面： Problem C: 三角Time Limit: 1 Sec  Memory Limit: 32 MBSubmit: 375  Solved: 56[Submit][Status][Web Board]Description...

题目链接：http://acm.zjut.edu.cn/onlinejudge/problem.php?cid=1101&pid=8题面：Problem I: no2Time Limit: 1 Sec  Memory Limit: 32 MBSubmit: 342  Solved: 23[Submit][Status][Web Board]Descrip

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3609题面：Modular InverseTime Limit: 2 Seconds      Memory Limit: 65536 KBThe modular modular multiplicative inve

题目链接：http://bestcoder.hdu.edu.cn/contests/contest_showproblem.php?cid=577&pid=1002题面：Greatest Greatest Common Divisor  Accepts: 271  Submissions: 1138 Time Limit: 4000/20

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5223题面：GCDTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4    Accepted Submiss

题目链接：http://cpp.zjut.edu.cn/ShowProblem.aspx?ShowID=1192题面：整数的因子数 Time Limit:2000MS  Memory Limit:32768KDescription:找出整数的所有因子数。 一个整数n的因子数为包含它自身的所有因子的个数。例如：12的因子数为6(1,2,3,4,6,12)。

题目链接：Fast Matrix Calculation题面：Fast Matrix CalculationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1078    Accepted Submiss

题目链接：Last Denfence题面： Last DefenceDescription    Given two integers A and B. Sequence S is defined as follow:    • S0 = A    • S1 = B    • Si = |Si−1 − Si−2| for i ≥ 2    Count the

题目链接：How many integers can you find题面：How many integers can you findTime Limit: 12000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5345   

题目链接：Coprime题面：CoprimeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1181    Accepted Submission(s): 471Problem Descripti

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5318题面：The Goddess Of The MoonTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 800

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5050题面：Divided LandTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1024    Accepted

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5512题面：PagodasTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 593    Accepted Submi

题面：Choose and divideThe binomial coefficient C(m; n) is defined as C(m; n) =m!/(m -n)! n! Given four natural numbers p, q, r, and s, compute the the result of dividing C(p; q) by C(r; s).Inp

题意：f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.给定A,B,求f(n)。法一：         网上较多的题解都提到了寻找1 1循环节的方法，的确非常巧妙，每位0~6，共7种可能，相邻两位共49种可能，因此循环周期至多为49，一旦出现相同数对，那么其后必相同。但是，该方法只是简单提及了49，却并