<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[remarkableyan的博客]]></title><description><![CDATA[一个acm菜鸟]]></description><link>https://blog.youkuaiyun.com/remarkableyan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; remarkableyan]]></copyright><item><title><![CDATA[牛客网第八场 ：E Touring cities  求哈密尔顿回路]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81606058</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81606058</guid><author>remarkableyan</author><pubDate>Sun, 12 Aug 2018 14:18:06 +0800</pubDate><description><![CDATA[标题：E、Touring cities | 时间限制：2秒 | 内存限制：256M

Niuniu wants to tour the cities in Moe country. Moe country has a total of n*m cities. The positions of the cities form a grid with n rows and m columns. We ...]]></description><category></category></item><item><title><![CDATA[牛客多校第七场C Bit Compression （dfs+剪枝）]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81564276</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81564276</guid><author>remarkableyan</author><pubDate>Fri, 10 Aug 2018 15:34:55 +0800</pubDate><description><![CDATA[ A binary string s of length N = 2 n is given. You will perform the following operation n times :
- Choose one of the operators AND (&amp;amp;), OR (|) or XOR (^). Suppose the current string is S = s 1 s ...]]></description><category></category></item><item><title><![CDATA[牛客多校第七场 Sudoku Subrectangles （dp+遍历+预处理）]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81561811</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81561811</guid><author>remarkableyan</author><pubDate>Fri, 10 Aug 2018 13:32:58 +0800</pubDate><description><![CDATA[ 

链接：https://www.nowcoder.com/acm/contest/145/J
来源：牛客网
 


You have a n * m grid of characters, where each character is an English letter (lowercase or uppercase, which means there are a total of 52 ...]]></description><category></category></item><item><title><![CDATA[Werewolf 2018杭电多校第六场I]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81514254</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81514254</guid><author>remarkableyan</author><pubDate>Wed, 08 Aug 2018 19:54:02 +0800</pubDate><description><![CDATA[Werewolf

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 367    Accepted Submission(s): 58
 

Problem Description

&quot;The Werewolves&quot; is a pop...]]></description><category></category></item><item><title><![CDATA[牛客网暑期ACM多校训练营（第三场）E Sort String]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81225484</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81225484</guid><author>remarkableyan</author><pubDate>Thu, 26 Jul 2018 18:51:05 +0800</pubDate><description><![CDATA[5. Eddy likes to play with string which is a sequence of characters. One day, Eddy has played with a string S
for a long time and wonders how could make it more enjoyable. Eddy comes up with following...]]></description><category></category></item><item><title><![CDATA[2018杭电暑期多校 hdoj6299 Balanced Sequence]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81190925</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81190925</guid><author>remarkableyan</author><pubDate>Tue, 24 Jul 2018 19:43:25 +0800</pubDate><description><![CDATA[Balanced Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3097    Accepted Submission(s): 795
 

Problem Description

Chiaki has n str...]]></description><category></category></item><item><title><![CDATA[2018杭电多校暑假 Distinct Values hdoj 6301]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81182558</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81182558</guid><author>remarkableyan</author><pubDate>Tue, 24 Jul 2018 12:21:54 +0800</pubDate><description><![CDATA[Distinct Values

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3336    Accepted Submission(s): 523
 

Problem Description

Chiaki has an arra...]]></description><category></category></item><item><title><![CDATA[2018杭电多校暑假 	Maximum Multiple hdoj6298]]></title><link>https://blog.youkuaiyun.com/remarkableyan/article/details/81182362</link><guid>https://blog.youkuaiyun.com/remarkableyan/article/details/81182362</guid><author>remarkableyan</author><pubDate>Tue, 24 Jul 2018 12:07:38 +0800</pubDate><description><![CDATA[Maximum Multiple

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 967    Accepted Submission(s): 445
 

Problem Description

Given an integer n...]]></description><category></category></item></channel></rss>