- 博客(12)
- 资源 (4)
- 收藏
- 关注
转载 逆元详解
今天我们来探讨逆元在ACM-ICPC竞赛中的应用,逆元是一个很重要的概念,必须学会使用它。 对于正整数和,如果有,那么把这个同余方程中的最小正整数解叫做模的逆元。 逆元一般用扩展欧几里得算法来求得,如果为素数,那么还可以根据费马小定理得到逆元为。 推导过程如下 求现在来看
2014-07-23 15:18:25 674
原创 hdu4864 task
#include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#define REP(i,a,b) for(int i=a;i<=b;++i)#define mset(a) memset(a,0,
2014-07-23 13:42:02 561
原创 hdu4870 Rating (高斯消元或者dp)
RatingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 213 Accepted Submission(s): 126Special JudgeProblem DescriptionA little girl lov
2014-07-23 11:01:58 1986 6
原创 POJ2151 概率题
Check the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4684 Accepted: 2050DescriptionOrganizing a programming contest is not an
2014-07-21 23:54:59 369
原创 POJ1860 Currency Exchange
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19419 Accepted: 6926DescriptionSeveral currency exchange points are working in our city
2014-07-21 17:38:13 328
原创 codeforces 449C construtive algorithms,number theory
link:http://codeforces.com/contest/450/problem/E
2014-07-21 14:15:04 601
原创 uva 11624 - Fire!(BFS)
Problem B: Fire!Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze.Given Joe
2014-07-17 12:50:41 1178
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人