Eminem1147的博客

Subset sequenceTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4587    Accepted Submission(s): 2228Problem DescriptionConsider the a

King's CakeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 444    Accepted Submission(s): 363Problem DescriptionIt is the king's bir

The Last PracticeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9449    Accepted Submission(s): 2010Problem DescriptionTomorrow is

给定三个数，求出它们的最大公约数和最小公倍数：gcd(a,b,c)=gcd(gcd(a,b),c)，lcm(a,b,c)=a*b*c/gcd/gcd。/*------------------Header Files------------------*/#include #include #include #include #include #include #include

So Easy!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3499    Accepted Submission(s): 1129Problem Description　　A sequence Sn is de

统计问题Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7701    Accepted Submission(s): 4523Problem Description在一无限大的二维平面中，我们做如下假设：1、 

以下内容来自转载：今天我们来探讨逆元在ACM-ICPC竞赛中的应用，逆元是一个很重要的概念，必须学会使用它。 对于正整数和，如果有，那么把这个同余方程中的最小正整数解叫做模的逆元。 逆元一般用扩展欧几里得算法来求得，如果为素数，那么还可以根据费马小定理得到逆元为。 推导过程如下                           

StripiesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17148 Accepted: 7764DescriptionOur chemical biologists have invented a new very useful form of