Two Semiknights Meet CodeForces - 362A

Two Semiknights Meet CodeForces - 362A A boy Petya loves chess very much. He even came up with a chess piece of his own, a semiknight...

2017-12-23 19:24:48

阅读数:114

评论数:0

Levko and Table CodeForces - 361A(思维)

Levko and Table CodeForces - 361A Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A tabl...

2017-12-19 17:57:25

阅读数:114

评论数:0

Petya and Staircases CodeForces - 362B(思维)

Petya and Staircases CodeForces - 362B   Little boy Petya loves stairs very much. But he is bored from simple going up and down them — he lo...

2017-12-19 16:29:56

阅读数:137

评论数:0

Levko and Permutation CodeForces - 361B(思维)

Levko and Permutation CodeForces - 361B Levko loves permutations very much. A permutation of length n is a sequence of distinct positive ...

2017-12-19 16:01:08

阅读数:106

评论数:0

Exponentiation POJ - 1001 (java)

Exponentiation POJ - 1001 Problems involving the computation of exact values of very large magnitude and precision are common. For example,...

2017-12-12 08:40:27

阅读数:170

评论数:0

Cow Contest POJ - 3660 (floyd求传递闭包)

Cow Contest POJ - 3660 N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows ...

2017-12-08 16:48:05

阅读数:134

评论数:0

Save your cats Aizu - 2224(并查集求最大生成树)

Save your cats Aizu - 2224 Nicholas Y. Alford was a cat lover. He had a garden in a village and kept many cats in his garden. The cats were so ...

2017-12-07 16:58:26

阅读数:146

评论数:0

Telephone Lines POJ - 3662(二分+最短路)

Telephone Lines POJ - 3662 Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperativ...

2017-12-07 16:23:12

阅读数:143

评论数:0

Candies POJ - 3159 (差分约束+最短路)

Candies POJ - 3159 During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of...

2017-12-06 21:07:25

阅读数:136

评论数:0

Agri-Net POJ - 1258 (最小生成树)

Agri-Net POJ - 1258 Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all fa...

2017-12-06 19:43:50

阅读数:112

评论数:0

Six Degrees of Cowvin Bacon POJ - 2139 (floyd求最短路)

Six Degrees of Cowvin Bacon POJ - 2139 The cows have been making movies lately, so they are ready to play a variant of the famous game &quo...

2017-12-06 19:40:11

阅读数:122

评论数:0

折线分割平面 HDU - 2050 (找规律)

折线分割平面 HDU - 2050 我们看到过很多直线分割平面的题目,今天的这个题目稍微有些变化,我们要求的是n条折线分割平面的最大数目。比如,一条折线可以将平面分成两部分,两条折线最多可以将平面分成7部分,具体如下所示。 Input 输入数据的第一行是一...

2017-12-03 20:02:40

阅读数:125

评论数:0

You're Given a String... CodeForces - 23A

You're Given a String... CodeForces - 23A You're given a string of lower-case Latin letters. Your task is to find the length of its longe...

2017-12-03 18:57:31

阅读数:157

评论数:0

Longest Ordered Subsequence POJ - 2533(dp动态规划)

Longest Ordered Subsequence POJ - 2533 A numeric sequence of ai is ordered if a1 a2 aN. Let the subsequence of the given numeric sequence ( a1, a...

2017-12-03 17:35:59

阅读数:132

评论数:0

Working out CodeForces - 429B (四个角dp)

Working out CodeForces - 429B Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach....

2017-12-03 10:41:05

阅读数:161

评论数:0

Oleg and shares CodeForces - 793A

Oleg and shares CodeForces - 793A Oleg the bank client checks share prices every day. There are n share prices he is interested in. Tod...

2017-12-03 09:34:28

阅读数:131

评论数:0

Popular Cows POJ - 2186 (强连通分量)

Popular Cows POJ - 2186 Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you ...

2017-12-01 20:14:35

阅读数:125

评论数:0

Swap HDU - 2819 (二分图最大匹配+路径还原)

Swap HDU - 2819 Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make...

2017-12-01 10:52:39

阅读数:148

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭