USACO
文章平均质量分 86
h1021456873
这个作者很懒,什么都没留下…
展开
-
USACO 提交测试
/** PROG:ride LANG:C++ ID:zpc19951 **/#include#include#include#include#includeusing namespace std;char s1[11],s2[11];int main(){ int i,j,num1,num2; freopen("ride.in","r",stdin);原创 2016-10-26 19:18:36 · 651 阅读 · 0 评论 -
usaco 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 sp原创 2016-10-30 16:49:00 · 284 阅读 · 0 评论 -
usaco 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 l原创 2016-10-29 16:03:04 · 326 阅读 · 0 评论 -
usaco Palindromic Squares (N进制下的回文串)
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原创 2016-10-29 15:17:02 · 317 阅读 · 0 评论 -
usaco 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 appl原创 2016-10-29 14:03:18 · 364 阅读 · 0 评论 -
usaco 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原创 2016-10-28 19:35:12 · 294 阅读 · 0 评论 -
usaco 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原创 2016-10-28 00:20:18 · 482 阅读 · 0 评论 -
usaco 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 f原创 2016-10-27 19:27:54 · 370 阅读 · 0 评论 -
usaco Friday the Thirteenth (数星期)
/** PROG:friday LANG:C++ ID:zpc19951 **/#include#include#include#includeusing namespace std;int f[11];bool judge(int y){ if((y%4==0&&y%100!=0)||y%400==0) return true; return fa原创 2016-10-27 19:23:47 · 223 阅读 · 0 评论 -
usaco 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}原创 2016-10-30 18:32:05 · 311 阅读 · 0 评论