<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[2=10]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a456052</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a456052]]></copyright><item><title><![CDATA[UVa1451 - Average]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/48525291</link><guid>https://blog.youkuaiyun.com/a456052/article/details/48525291</guid><author>a456052</author><pubDate>Thu, 17 Sep 2015 17:59:43 +0800</pubDate><description><![CDATA[UVa1451 - AverageA DNA sequence consists of four letters, A, C, G, and T. The GC-ratio of a DNA sequence is the 
number of Cs and Gs of the sequence divided by the length of the sequence. GC-ratio is i]]></description><category></category></item><item><title><![CDATA[UVa1471 - Defense Lines]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/48442767</link><guid>https://blog.youkuaiyun.com/a456052/article/details/48442767</guid><author>a456052</author><pubDate>Mon, 14 Sep 2015 18:04:19 +0800</pubDate><description><![CDATA[UVa1471 - Defense LinesAfter the last war devastated your country, you - as the king of the land of Ardenia - decided it was high time to improve the defense of your capital city. A part of your fortif]]></description><category></category></item><item><title><![CDATA[UVa11134 - Fabled Rooks(贪心)]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/48297901</link><guid>https://blog.youkuaiyun.com/a456052/article/details/48297901</guid><author>a456052</author><pubDate>Tue, 08 Sep 2015 21:38:37 +0800</pubDate><description><![CDATA[11134 - Fabled RooksWe would like to place nn rooks, 1≤n≤50001 ≤ n ≤ 5000, on a n×nn × n board subject to the following restrictions 
• The i-th rook can only be placed within the rectangle given by it]]></description><category></category></item><item><title><![CDATA[UVa1152 - 4 Values whose Sum is 0]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/48198091</link><guid>https://blog.youkuaiyun.com/a456052/article/details/48198091</guid><author>a456052</author><pubDate>Thu, 03 Sep 2015 20:59:57 +0800</pubDate><description><![CDATA[1152 - 4 Values whose Sum is 0The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a,b,c,d)∈A×B×C×D(a, b, c, d) ∈ A × B × C × D are]]></description><category></category></item><item><title><![CDATA[Codeforces Gym100650E:   Reliable Nets]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47817551</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47817551</guid><author>a456052</author><pubDate>Thu, 20 Aug 2015 22:40:28 +0800</pubDate><description><![CDATA[Problem E:   Reliable NetsYou’re in charge of designing a campus network between buildings and are very worried about its reliability and its cost. So, you’ve decided to build some redundancy into your]]></description><category></category></item><item><title><![CDATA[Codeforces Gym100650C The Game of Efil]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47777569</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47777569</guid><author>a456052</author><pubDate>Wed, 19 Aug 2015 11:03:51 +0800</pubDate><description><![CDATA[Problem C:     The Game of EfilAlmost anyone who has ever taken a class in computer science is familiar with the “Game of Life,” John Conway’s cellular automata with extremely simple rules of birth, su]]></description><category></category></item><item><title><![CDATA[Codeforces Round #316 (Div. 2) C. Replacement]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47679819</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47679819</guid><author>a456052</author><pubDate>Sat, 15 Aug 2015 10:37:40 +0800</pubDate><description><![CDATA[C. Replacementtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDaniel has a string s, consisting of lowercase English letters and period signs (char]]></description><category></category></item><item><title><![CDATA[Codeforces Round #316 (Div. 2) B. Simple Game]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47679635</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47679635</guid><author>a456052</author><pubDate>Sat, 15 Aug 2015 10:19:32 +0800</pubDate><description><![CDATA[B. Simple Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Misha and Andrew were playing a very simple game. First, each player chooses a]]></description><category></category></item><item><title><![CDATA[Codeforces Round #316 (Div. 2) A. Elections]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47679483</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47679483</guid><author>a456052</author><pubDate>Sat, 15 Aug 2015 10:05:16 +0800</pubDate><description><![CDATA[A. Electionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe country of Byalechinsk is running elections involving n candidates. The country cons]]></description><category></category></item><item><title><![CDATA[HDU4587 TWO NODES]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47607877</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47607877</guid><author>a456052</author><pubDate>Thu, 13 Aug 2015 10:29:19 +0800</pubDate><description><![CDATA[TWO NODESTime Limit: 24000/12000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1452    Accepted Submission(s): 442Problem Description Suppose that G is an undirected]]></description><category></category></item><item><title><![CDATA[Codeforces Gym100425 H. Football Bets]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47607335</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47607335</guid><author>a456052</author><pubDate>Thu, 13 Aug 2015 10:20:23 +0800</pubDate><description><![CDATA[H. Football Betstime limit per test1 secondmemory limit per test128 megabytesinputstandard inputoutputstandard outputWhile traveling to England, it is impossible not to catch the English passion for fo]]></description><category></category></item><item><title><![CDATA[Codeforces Gym100425 D. Toll Road]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47462137</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47462137</guid><author>a456052</author><pubDate>Thu, 13 Aug 2015 00:03:04 +0800</pubDate><description><![CDATA[D. Toll Roadtime limit per test1 secondmemory limit per test128 megabytesinputstandard inputoutputstandard outputExactly N years ago, a new highway between two major cities was built. The highway runs]]></description><category></category></item><item><title><![CDATA[Codeforces Gym100425 A. Luggage Distribution]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47460535</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47460535</guid><author>a456052</author><pubDate>Wed, 12 Aug 2015 23:55:07 +0800</pubDate><description><![CDATA[A. Luggage Distributiontime limit per test1 secondmemory limit per test128 megabytesinputstandard inputoutputstandard outputAll provident tourists know about low-cost airlines. Those who used them at l]]></description><category></category></item><item><title><![CDATA[TopCoder SRM665 Div2 B]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47456575</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47456575</guid><author>a456052</author><pubDate>Wed, 12 Aug 2015 23:31:14 +0800</pubDate><description><![CDATA[Problem StatementThis problem is about trees. A tree consists of some special points (called nodes), and some lines (called edges) that connect those points. Each edge connects exactly two nodes. If th]]></description><category></category></item><item><title><![CDATA[TopCoder SRM665 Div2 A]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47455631</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47455631</guid><author>a456052</author><pubDate>Wed, 12 Aug 2015 23:23:01 +0800</pubDate><description><![CDATA[Problem StatementA lucky number is a positive integer consisting of only the digits 4 and 7.Given an int a, return an int b strictly greater than a, such that a XOR b is a lucky number. (See Notes for]]></description><category></category></item><item><title><![CDATA[URAL2048 History]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47417587</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47417587</guid><author>a456052</author><pubDate>Tue, 11 Aug 2015 11:23:00 +0800</pubDate><description><![CDATA[2048. HistoryTime limit: 1.0 secondMemory limit: 64 MBAndroid Vasya likes the history of the ancient world. 
He likes to read about various superstitions people had at that time.Recently Vasya came acr]]></description><category></category></item><item><title><![CDATA[URAL2046 The First Day at School]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47417355</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47417355</guid><author>a456052</author><pubDate>Tue, 11 Aug 2015 11:12:08 +0800</pubDate><description><![CDATA[2046. The First Day at SchoolTime limit: 1.0 second 
Memory limit: 64 MBVasya is a young and very promising android. Today is his first day at University. Vasya has very carefully studied the list of a]]></description><category></category></item><item><title><![CDATA[Codeforces Round #315 (Div. 2) C. Primes or Palindromes?]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47417253</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47417253</guid><author>a456052</author><pubDate>Tue, 11 Aug 2015 11:05:15 +0800</pubDate><description><![CDATA[C. Primes or Palindromes?time limit per test3 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard outputRikhail Mubinchik believes that the current definition of prime numb]]></description><category></category></item><item><title><![CDATA[Codeforces Round #315 (Div. 2) B. Inventory]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47416861</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47416861</guid><author>a456052</author><pubDate>Tue, 11 Aug 2015 10:50:14 +0800</pubDate><description><![CDATA[B. Inventorytime limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard outputCompanies always have a lot of equipment, furniture and other things. All of them]]></description><category></category></item><item><title><![CDATA[Codeforces Round #315 (Div. 2) A. Music]]></title><link>https://blog.youkuaiyun.com/a456052/article/details/47416753</link><guid>https://blog.youkuaiyun.com/a456052/article/details/47416753</guid><author>a456052</author><pubDate>Tue, 11 Aug 2015 10:45:31 +0800</pubDate><description><![CDATA[A. Musictime limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard outputLittle Lesha loves listening to music via his smartphone. But the smartphone doesn’t]]></description><category></category></item></channel></rss>