我家有个zz~

Discussion Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each

Discussion A chemical company has an unusual shortest path problem. There are N depots (vertices) where chemicals can be stored. There are M individual shipping methods (edges) connecting pairs o

Discussion Your task is to write a program of a simple dictionary which implements the following instructions: insert str: insert a string str in to the dictionary find str: if the distionary c

Discussion Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regr

#include <cstdio>#include <iostream>#include <cstring>const int MAXN = 510;int uN,vN;int g[MAXN][MAXN];int linker[MAXN];bool used[MAXN];bool dfs(int u){ for(int v = 1; v <= vN;v++) if(

Description Bessie 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 milking. Bessie needs her beauty sleep, so she w

Problem Description 糟糕的事情发生啦，现在大家都忙着逃命。但是逃命的通道很窄，大家只能排成一行。 现在有n个人，从1标号到n。同时有一些奇怪的约束条件，每个都形如：a必须在b之前。 同时，社会是不平等的，这些人有的穷有的富。1号最富，2号第二富，以此类推。有钱人就贿赂负责人，所以他们有一些好处。 负责人现在可以安排大家排队的顺序，由于收了好处，所以他要让1号

Do more with lessDescription While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to it

Do more with lessDescription For a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation. Given a complete graph of n nodes with all

搜索......

搜索......

并查集......

DP+搜索的简单组合

Description Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P stu

//Dijkstra#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <queue>using namespace std;const int INF = 0x3f3f3f3f;const int MAX = 5005;typede