摘要：
Poj 2084 Game of Connections 卡特兰数高精度 Input Each line of the input file will be a single positive number n, except the last line, which is a number 1. 阅读全文
摘要：
Poj 1087 A Plug for UNIX 最大流 题目描述： You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive ( 阅读全文
摘要：
数论概论 第8章 同余式 主要讨论如何求解同余式 $ax \equiv c (mod \ m) $ 显然判断此同余式是否有解相当于判断线性方程 $ax my=c$ 是否有解 我们对于$ax+by = c$ 类型的线性方程当且仅当$gcd(a,b)|c$ 时有解 求解方式可以通过下面的代码求解（拓展欧 阅读全文
摘要：
Poj1459 Power Network 预流推进 问题描述： A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A n 阅读全文
摘要：
Poj Optimal Milking 2112 floyd+dinic+二分 FJ has moved his K (1 15, a row is broken into successive lines of 15 numbers and a potentially shorter line 阅读全文
摘要：
最大流 POJ1273 Drainage Ditches 题目描述：Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the c 阅读全文
摘要：
网络最大流各算法总结 网络最大流的算法共有两大类5种算法 总体如下表：n为顶点数，m为弧的数目，U代表各条弧的最大容量 | 算法名称 | 复杂度 | 算法概要 | | : : | | | | 一般增广路算法 | $O(nmU)$ | 采取标号法每次在容量网络中寻找一条增广路进行增广(或在残留网络中每 阅读全文
摘要：
Poj 1149 Pigs Mirko works on a pig farm that consists of M locked pig houses and Mirko can't unlock any pighouse because he doesn't have the keys. Cus 阅读全文
摘要：
Problem Description 电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。 某天，食堂中有n种菜出售，每种 阅读全文
摘要：
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, an 阅读全文