Mr_Treeeee的博客

Balala Power!Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1317    Accepted Submission(s): 229Problem DescriptionTalente

Superlong sumsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23223 Accepted: 6889DescriptionThe creators of a new programming language D++ have found o

ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 171270 Accepted: 41478DescriptionProblems involving the computation of exact values of ve

OracleTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1235    Accepted Submission(s): 535Problem DescriptionThere is once a ki

NumbersTime Limit: 2 Seconds      Memory Limit: 65536 KBDreamGrid has a nonnegative integer . He would like to divide  into  nonnegative integers  and minimizes their bitwise or (i.e. an

Consider the error function F(x,y,z,n)=∣xn+yn−zn∣F(x,y,z,n)=∣xn+yn−zn∣, where ∣v∣∣v∣ means the absolute value of vv. Given two positive integers nn and zz, our problem is to find two positive integers...

点击打开链接 POINT： 答案为C（n+m,m）或者C(n+m,n)。然后因为完全模拟为超时。JAVA大数乘法超时。那么先把分母分子全部质因数分解。把答案化为质因数的个数。然后作高精度低乘  #include <iostream>#include <stdio.h>#include <algorithm>#i...