![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
POJ
文章平均质量分 80
tch_1997
这个作者很懒,什么都没留下…
展开
-
POJ1284 Primitive Roots
http://poj.org/problem?id=1284DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the consecutive powers of 3 modulo 7 are 3, 2, 6, 4原创 2017-01-23 23:47:18 · 239 阅读 · 0 评论 -
POJ1006生理周期----【模板】CRT中国剩余定理即孙子定理即求解一次同余方程
Chinese remainder theorem(CRT):中国剩余定理是求解一次线性同余方程组的方法。中国剩余定理: 假设整数m1,m2, … ,mn两两互素,则同余方程组 有整数解。 设 是m1,m2,m3…mn的乘积,并设 是除了mi以外的n-1个整数的乘积。 设是Mi模mi的逆元(数论中的倒数)。那么在模M下的解是唯一的。原创 2017-04-02 22:25:48 · 897 阅读 · 0 评论 -
POJ 1061青蛙的约会【扩展欧几里德算法】
http://poj.org/problem?id=1061 A - 青蛙的约会 POJ - 1061 #include#includeusing namespace std;long long x,y,q;long long X,Y,M,N,L;void exgcd(long long a,long long b){ if(b==0)原创 2017-01-23 20:16:25 · 358 阅读 · 0 评论 -
POJ 1125Stockbroker Grapevine 【最短路】
http://poj.org/problem?id=1125POJ - 1125 Stockbroker GrapevineDescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading原创 2017-01-23 20:28:11 · 262 阅读 · 0 评论 -
POJ1860 Currency Exchange【bellman-Ford算法】
http://poj.org/problem?id=1860DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs ex原创 2017-01-23 20:45:15 · 295 阅读 · 0 评论 -
POJ 2240Arbitrage
http://poj.org/problem?id=2240DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency原创 2017-01-23 20:48:31 · 218 阅读 · 0 评论 -
POJ1502MPI Maelstrom 【Dijkstra】
http://poj.org/problem?id=1502DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical c原创 2017-01-23 23:31:05 · 245 阅读 · 0 评论 -
POJ2407 Relatives 【欧拉函数模板】
https://vjudge.net/problem/POJ-2407RelativesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14310 Accepted: 7151DescriptionGiven n, a positi原创 2017-03-19 15:52:44 · 307 阅读 · 0 评论 -
POJ - 2387Til the Cows Come Home
http://poj.org/problem?id=2387DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milkin原创 2017-01-23 20:51:11 · 213 阅读 · 0 评论 -
POJ2773 Happy
http://poj.org/problem?id=2773DescriptionTwo positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9...are all原创 2017-01-23 23:45:33 · 208 阅读 · 0 评论 -
2017暑假PKU课程
1) 二分算法2) 分治算法3) 动态规划4) 搜索算法:深度优先 搜索,广度优先搜,A*算法 ,阿尔法贝塔剪枝5) 数据结构: 线段树, 树状数组,并查集,Trie图6) 图论问题:最小生成树 最短路 强连通分量、桥和割点7) 网络流算法:基本的网络流算法,Dinic算法,带上下界的网络流,最小费用流8) 计算几何:线与线求交,线与面求交,求凸包,半原创 2017-08-29 18:07:29 · 290 阅读 · 0 评论