- 博客(12)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 USACO1.3.4 Prime Cryptarithm(牛式)
The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set of N digits into the positions marked with *. If the set of prime digits {2,3,5,7}
2013-08-05 13:27:34
1536
原创 USACO1.3.2 Barn Repair(修理牛棚)
It was a dark and stormy night that ripped the roof and gates off the stalls that hold Farmer John's cows. Happily, many of the cows were on vacation, so the barn was not completely full. The cows
2013-08-05 12:45:09
1344
2
原创 USACO1.3.1 Mixing Milk(混合牛奶)
Since milk packaging is such a low margin business, it is important to keep the price of the raw product (milk) as low as possible. Help Merry Milk Makers get the milk they need in the cheapest possib
2013-01-10 17:02:52
1984
原创 USACO1.2.5 Dual Palindromes(双重回文数)
A number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes have neither
2013-01-09 13:20:54
846
原创 USACO1.2.4 Palindromic Squares(回文平方数)
Palindromes are numbers that read the same forwards as backwards. The number 12321 is a typical palindrome. Given a number base B (2 <= B <= 20 base 10), print all the integers N (1 <= N <= 300 base
2013-01-09 13:01:12
1052
原创 USACO1.2.3 Name That Number(命名那个数字)
Among the large Wisconsin cattle ranchers, it is customary to brand cows with serial numbers to please the Accounting Department. The cow hands don't appreciate the advantage of this filing system,
2013-01-09 12:23:43
1137
原创 USACO1.2.2 Transformations (方块转换)
A square pattern of size N x N (1 <= N <= 10) black and white square tiles is transformed into another square pattern. Write a program that will recognize the minimum transformation that has been ap
2013-01-08 20:19:11
1059
原创 USACO1.2.1 Milking Cows(挤牛奶)
Three farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000. The second
2013-01-08 16:01:00
1992
原创 USACO1.1.4 Broken Necklace(破碎的项链)
You have a necklace of N red, white, or blue beads (3 1 2 1 2 r b b r b r r b r b
2013-01-08 12:46:43
1234
原创 USACO1.1.3 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 compu
2013-01-08 11:38:01
874
原创 USACO1.1.2 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
2013-01-08 11:23:15
1566
1
原创 USACO1.1.1 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 follower
2013-01-07 22:55:33
1076
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人