关闭
当前搜索:

Fermat vs. Pythagoras POJ - 1305(本原勾股数组)

Fermat vs. Pythagoras POJ - 1305 Computer generated and assisted proofs and verification occupy a small niche in the realm of Computer Science. The first proof of the four-color problem was comp...
阅读(35) 评论(0)

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. The semiknight can move in any of these four dire...
阅读(58) 评论(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 table is beautiful to Levko if the sum of eleme...
阅读(58) 评论(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 loves jumping over several stairs at a time. As he st...
阅读(53) 评论(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 integers, each is at most n. Let’s assume that v...
阅读(50) 评论(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, the computation of the national debt is a taxing e...
阅读(87) 评论(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 code better than others. Each cow has a cer...
阅读(57) 评论(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 cute that people in the village also loved them. ...
阅读(55) 评论(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 uncooperative, so he needs to pay for some of the cables requir...
阅读(70) 评论(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 flymouse’s class a large bag of candies and had fl...
阅读(57) 评论(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 farms in the area. He needs your help, of course. ...
阅读(69) 评论(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 "Six Degrees of Kevin Bacon". The game works like ...
阅读(58) 评论(0)

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

折线分割平面 HDU - 2050 我们看到过很多直线分割平面的题目,今天的这个题目稍微有些变化,我们要求的是n条折线分割平面的最大数目。比如,一条折线可以将平面分成两部分,两条折线最多可以将平面分成7部分,具体如下所示。 Input 输入数据的第一行是一个整数C,表示测试实例的个数,然后是C 行数据,每行包含一个整数n(0 Output 对于每个测...
阅读(64) 评论(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 longest substring that can be met in the string at least...
阅读(79) 评论(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, a2, ..., aN) be any sequence ( ai1, ai2, .....
阅读(68) 评论(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. The gym where they go is a matrix a with n lines ...
阅读(83) 评论(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. Today he observed that each second exactly one of thes...
阅读(86) 评论(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 are given up to M (1 <= M <= 50,000) ordered pairs of the...
阅读(78) 评论(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 all the diagonal entries equal to 1? Input Th...
阅读(86) 评论(0)

Oil Skimming HDU - 4185 (二分图最大匹配)

Oil Skimming  HDU - 4185  Thanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floating in the Gul...
阅读(93) 评论(0)
158条 共8页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:14311次
    • 积分:1525
    • 等级:
    • 排名:千里之外
    • 原创:143篇
    • 转载:15篇
    • 译文:0篇
    • 评论:2条
    最新评论