<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Gerry99的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Gerry99</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Gerry99]]></copyright><item><title><![CDATA[NOIP C++ 3天入门]]></title><link>https://blog.youkuaiyun.com/Gerry99/article/details/82047614</link><guid>https://blog.youkuaiyun.com/Gerry99/article/details/82047614</guid><author>Gerry99</author><pubDate>Sat, 25 Aug 2018 05:30:39 +0800</pubDate><description><![CDATA[闲来无事写了点noip方面的C++语法入门的教程。没有包含指针，毕竟noip不提倡写指针。除下day1就是noip和编程比赛的介绍，总共3天3篇。每篇都有习题。

链接: https://pan.baidu.com/s/1yT9--ypOfM1J0v7oJGD0IA 密码: zdaz

希望能帮到大家！...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2) A -- D]]></title><link>https://blog.youkuaiyun.com/Gerry99/article/details/70206602</link><guid>https://blog.youkuaiyun.com/Gerry99/article/details/70206602</guid><author>Gerry99</author><pubDate>Mon, 17 Apr 2017 04:34:48 +0800</pubDate><description><![CDATA[A. Vicious Keyboard


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Tonio has a keyboard with only two lett]]></description><category></category></item><item><title><![CDATA[Topcoder SRM 709 DIV 2 500pt Permatchd2 solution]]></title><link>https://blog.youkuaiyun.com/Gerry99/article/details/56448726</link><guid>https://blog.youkuaiyun.com/Gerry99/article/details/56448726</guid><author>Gerry99</author><pubDate>Wed, 22 Feb 2017 04:23:13 +0800</pubDate><description><![CDATA[Problem Statement




    


Hero has a simple undirected graph. (Simple means that each edge connects two different vertices, and each pair of vertices is connected by at most one edge.)
A g]]></description><category></category></item><item><title><![CDATA[Topcoder SRM 709 DIV 2 250pt Robofactory solution]]></title><link>https://blog.youkuaiyun.com/Gerry99/article/details/56448517</link><guid>https://blog.youkuaiyun.com/Gerry99/article/details/56448517</guid><author>Gerry99</author><pubDate>Wed, 22 Feb 2017 04:22:15 +0800</pubDate><description><![CDATA[Problem Statement




    


Hero owns a factory. There are n robots working at the factory. The robots are numbered 0 through n-1.
Today, exactly one of the robots became corrupted. Hero has]]></description><category></category></item><item><title><![CDATA[Codeforces Round #369 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/Gerry99/article/details/56448370</link><guid>https://blog.youkuaiyun.com/Gerry99/article/details/56448370</guid><author>Gerry99</author><pubDate>Wed, 22 Feb 2017 04:21:09 +0800</pubDate><description><![CDATA[A. Bus to Udayland



time limit per test

2 seconds



memory limit per test

256 megabytes



input

standard input



output

standard output




ZS the Coder and Chris]]></description><category></category></item><item><title><![CDATA[codeforces AIM Tech Round 3 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/Gerry99/article/details/56447814</link><guid>https://blog.youkuaiyun.com/Gerry99/article/details/56447814</guid><author>Gerry99</author><pubDate>Wed, 22 Feb 2017 04:17:57 +0800</pubDate><description><![CDATA[codeforces AIM Tech Round 3
 (Div. 2)











A. Juicer



time limit per test

1 second



memory limit per test

256 megabytes



input

standard input



outpu]]></description><category></category></item></channel></rss>