2017年10月_雪的期许

原创 uva1637 概率dp（记忆化搜索）

Double Patience is a single player game played with a standard 36-card deck. The cards are shuffled and laid down on a table in 9 piles of 4 cards each, faces up. After the cards are laid down, the player makes turns. In a turn he can take top cards of the

2017-10-31 15:31:22 593

原创 uva11181 条件概率

N friends go to the local super market together. The probability of their buying something from the market is p1, p2, p3, . . . , pN respectively. After their marketing is finished you are given the

2017-10-31 11:18:40 630

原创 HDU4810 亦或，组合数

Ms.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color of pigments by mixing water and some bags of pigments. On the K-th day, she will select K specific bags of pigments and

2017-10-30 15:47:00 650

原创 UVa10375（唯一分解定理）

The binomial coefficient C(m, n) is defined as C(m, n) = m! (m − n)! n! Given four natural numbers p, q, r, and s, compute the the result of dividing C(p, q) by C(r, s). Input Input consists of a sequence of lines. Each line contains four non-negative inte

2017-10-26 17:16:49 825

原创 UVa12169（拓展欧几里得）

Once upon a time, there was an NWERC judge with a tendency to create slightly too hard problems. As a result, his problems were never solved. As you can image, this made our judge somewhat frustrated. This year, this frustration has culminated, and he has

2017-10-26 13:15:41 871

原创最小费用流 uva10806

You are a political prisoner in jail. Things are looking grim, but fortunately, your jailmate has come up with an escape plan. He has found a way for both of you to get out of the cell and run through the city to the train station, where you will leave the

2017-10-21 20:45:35 754

原创 HDU 5934 强连通分量

There are NN bombs needing exploding. Each bomb has three attributes: exploding radius riri, position (xi,yi)(xi,yi) and lighting-cost cici which means you need to pay cici cost making it explode. If a un-lighting bomb is in or on the border the explod

2017-10-21 19:05:18 796

原创 tarjan算法的学习 uva12167,uva315,uva796

图的强连通&tarjan算法强连通图：如果有向图G中的任意两个点u，v是互相可到达的，则称图G为强连通图。否则G为非强连通图。强连通分量：若有向图G为非强连通图，它的子图G' 是强连通图，则称G' 为G的强连通分量。（极大强连通子图）返图：将有向图G中的所有边的方向逆置，即u->v变为v->u 定理：对于一个有向图G，按照dfs的后序遍历到的点

2017-10-19 22:20:39 440

原创 floyd求图的最小环路 HDU1599

find the mincost route Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5879 Accepted Submission(s): 2346 Problem Description 杭州有N个景区，景区之间有一些双向的路来连接，现在8600想找一条旅游路线，这个路线从A点出发并且最后回到A点，假设经过的路线为V1,

2017-10-10 13:04:15 1045

原创树的最小支配集poj3659、最小点覆盖、最大独立集

Cell Phone Network Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7002 Accepted: 2509 Description Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to se

2017-10-09 19:56:09 792

雪的期许

原创 uva1637 概率dp（记忆化搜索）

原创 uva11181 条件概率

原创 HDU4810 亦或，组合数

原创 UVa10375（唯一分解定理）

原创 UVa12169（拓展欧几里得）

原创最小费用流 uva10806

原创 HDU 5934 强连通分量

原创 tarjan算法的学习 uva12167,uva315,uva796

原创 floyd求图的最小环路 HDU1599

原创树的最小支配集poj3659、最小点覆盖、最大独立集

原创 HDU 6129 just do it（组合数奇偶性）

原创 HDU 6090 Rikka with Graph （图论规律题）

原创 HDU 4474 同余模定理+BFS

原创 HDU 4465 Candy 概率期望值的对数优化

原创 ICPC2015（沈阳）HDU5521 建图技巧+最短路

空空如也

空空如也