<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[billoshi_USACO]]></title><description><![CDATA[USACO is better.]]></description><link>https://blog.youkuaiyun.com/billoshi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; billoshi]]></copyright><item><title><![CDATA[帮我忙]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1583483</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1583483</guid><author>billoshi</author><pubDate>Tue, 24 Apr 2007 22:36:00 +0800</pubDate><description><![CDATA[ ]]></description><category></category></item><item><title><![CDATA[My USACO Analysis:Friday the Thirteenth]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1573302</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1573302</guid><author>billoshi</author><pubDate>Fri, 20 Apr 2007 23:05:00 +0800</pubDate><description><![CDATA[This is a typical Brute Force.Theres nothing to say because this is so easy!All you need is to notice the details.program friday(input,output);const  monthday:array[1..12]of byte=(3,0,3,2,3,2,3,3]]></description><category></category></item><item><title><![CDATA[Analysis:Friday the Thirteenth]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1573297</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1573297</guid><author>billoshi</author><pubDate>Fri, 20 Apr 2007 23:01:00 +0800</pubDate><description><![CDATA[Brute force is a wonderful thing.  400 years is only 4800 months, so it is perfectly practical to just walk along every month of every year, calculating the day of week on which the 13th occurs for ea]]></description><category></category></item><item><title><![CDATA[Friday the Thirteenth]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1573291</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1573291</guid><author>billoshi</author><pubDate>Fri, 20 Apr 2007 22:57:00 +0800</pubDate><description><![CDATA[ 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 c]]></description><category></category></item><item><title><![CDATA[My USACO Analysis:Greedy Gift Givers]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1573289</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1573289</guid><author>billoshi</author><pubDate>Fri, 20 Apr 2007 22:55:00 +0800</pubDate><description><![CDATA[To record the names,I used an array of string.And I used another one to save the numbers that should be printed out.This is also an sd hoc problem-as easy as it could be!program gift1(input,outp]]></description><category></category></item><item><title><![CDATA[Analysis:Greedy Gift Givers]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1571380</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1571380</guid><author>billoshi</author><pubDate>Thu, 19 Apr 2007 22:48:00 +0800</pubDate><description><![CDATA[The hardest part about this problem is dealing with the strings representing peoples names.  We keep an array of Person structures that contain their name and how much money they give/get.  The h]]></description><category></category></item><item><title><![CDATA[Greedy Gift Givers]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1571376</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1571376</guid><author>billoshi</author><pubDate>Thu, 19 Apr 2007 22:45:00 +0800</pubDate><description><![CDATA[ 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 ]]></description><category></category></item><item><title><![CDATA[Ad Hoc Problems]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1569733</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1569733</guid><author>billoshi</author><pubDate>Wed, 18 Apr 2007 21:51:00 +0800</pubDate><description><![CDATA[ `Ad hoc problems are those whose algorithms do not fall into standard categories with well-studied solutions.  Each ad hoc problem is different; no specific or general techniques exist to solve them]]></description><category></category></item><item><title><![CDATA[My USACO Analysis:Your Ride Is Here]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1569730</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1569730</guid><author>billoshi</author><pubDate>Wed, 18 Apr 2007 21:50:00 +0800</pubDate><description><![CDATA[Here is my own solution in PASCAL:program ride(input,output);const  a:array[A..Z]of integer=(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26);var  s:string;  l,i,sum1,sum2]]></description><category></category></item><item><title><![CDATA[Analysis: Your Ride Is Here]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1569724</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1569724</guid><author>billoshi</author><pubDate>Wed, 18 Apr 2007 21:45:00 +0800</pubDate><description><![CDATA[ This is probably the easiest problem in the entire set of lessons. An `ad hoc problem, no particular algorithms or tricks are needed save one:  one must be careful to get all 72 characters of input ]]></description><category></category></item><item><title><![CDATA[Your Ride Is Here]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1569718</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1569718</guid><author>billoshi</author><pubDate>Wed, 18 Apr 2007 21:42:00 +0800</pubDate><description><![CDATA[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 o]]></description><category></category></item><item><title><![CDATA[Programming Contest Problem Types]]></title><link>https://blog.youkuaiyun.com/billoshi/article/details/1569714</link><guid>https://blog.youkuaiyun.com/billoshi/article/details/1569714</guid><author>billoshi</author><pubDate>Wed, 18 Apr 2007 21:40:00 +0800</pubDate><description><![CDATA[ Programming Contest Problem TypesHal Burch conducted an analysis over spring break of 1999 and made an amazing discovery: there are only 16 types of programming contest problems! Furthermore, the t]]></description><category></category></item></channel></rss>