2011年01月_xieshimao

原创 POJ 1142 暴力!

Smith NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8209 Accepted: 2867 DescriptionWhile skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University,noticed that the telephone number of his brother-in

2011-01-30 20:37:00 1358

原创 TOJ 比赛C题 Visiting Cows （TJU 2011 Exercise Contest 04）

C. Visiting CowsTime Limit: 1.0 Seconds Memory Limit: 65536K Total Runs: 61 Accepted Runs: 21 Multiple test files Description After many weeks of hard work, Bessie is finally getting a vacation! Being the most social cow

2011-01-30 16:48:00 1044

原创 POJ 1411 数论+优化

Calling Extraterrestrial Intelligence AgainTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9219 Accepted: 3669 DescriptionA m

2011-01-30 16:46:00 1281

原创 POJ 2803 字符串识别

Defining MomentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1341 Accepted: 603 DescriptionAs a homework assignment, you have been tasked with creating a program that provides the meanings for many different words. As you dislike the idea

2011-01-23 12:29:00 1330

原创 POJ 2584 最大匹配。匈牙利算法

T-Shirt GumboTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1437 Accepted: 635 DescriptionBoudreaux and Thibodeaux are student volunteers for this year's ACM South Central Region's programming contest. One of their duties is to distribute t

2011-01-16 00:48:00 1578

原创 POJ 3565 KM算法

AntsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1842 Accepted: 527 Special Judge Description Young naturalist Bill s

2011-01-15 23:38:00 2250

原创 POJ 3298 递推，DP

AntimonotonicityTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2428 Accepted: 995 Description I have a sequence Fred of length n comprised of integers between 1 and n inclusive. The elements of Fred are pairwise distinct. I want to fin

2011-01-14 23:55:00 1136

原创 POJ 1486 二分图的最大匹配（强化）

Sorting SlidesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1801 Accepted: 648 DescriptionProfessor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies o

2011-01-14 21:57:00 1078

原创 USACO firday 模拟

Friday the Thirteenth Is Friday the 13th really an unusual event? That is, does the 13th of the month land on a Friday less often than on any other day of the week? To answer this question, write a program that will compute the frequency t

2011-01-11 17:19:00 1111

原创 POJ 2446 最大匹配算法

ChessboardTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6719 Accepted: 2103 DescriptionAlice and Bob often play games on chessboard. One day, Alice draws a board with size M * N. She wants Bob to use a lot of cards with size 1 * 2 to cover

2011-01-10 19:28:00 1113

原创 USACO gift1

Greedy Gift Givers A group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not give some money to any or all of the other friends. Likewise, each friend might or might not receive

2011-01-08 14:49:00 912

原创 USACO ride

Your Ride Is Here It is a well-known fact that behind every good comet is a UFO. These UFOs often come to collect loyal supporters from here on Earth. Unfortunately, they only have room to pick up one group of followers on each trip. They do, however,

2011-01-08 14:46:00 653

原创 POJ 1833 STL容器运用

排列Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9466 Accepted: 4183 Description题目描述： 大家知道，给出正整数n，则1到n这n个数可以构成n！种排列，把这些排列按照从小到大的顺序（字典顺序）列出，如n=3时，列出1 2 3，1 3 2，2 1 3，2 3 1，3 1 2，3 2 1六个排列。 任务描述： 给出某个排列，求出这个排列的下k个排列，如果

2011-01-03 21:47:00 1167

bingshen的专栏