yjt9299的博客

D. Pair of Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSimon has an array a1, a2, ..., an, co

FactorialTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4258    Accepted Submission(s): 2819Problem DescriptionThe most importa

N!Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 84572    Accepted Submission(s): 24941Problem DescriptionGiven an integer N

Humble NumbersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27389    Accepted Submission(s): 12066Problem DescriptionA number

Diophantus of AlexandriaTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4214 Accepted: 1471DescriptionDiophantus of Alexandria was an Egypt mathematician living in Alexandria. He was one of ...

传送门题意：  给你一个数n  你要找出他的最大 组成方案 就比如  3  那么一个数的时候 只有3  两个数的时候就有 1 2   和  2 1  两种三个数的时候就有  1 1 1   一种  ，  那么找一下规律就是 n  的种类数就是2 的n-1  次方。数论基础：  费马小定理。a^(p-1) %p=1    注意  p  是素数！！！费马小定理的公式 ，我们知道  1e9+7  是一个...