<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a15666236的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a15666236</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a15666236]]></copyright><item><title><![CDATA[Codeforces C - Registration System]]></title><link>https://blog.youkuaiyun.com/a15666236/article/details/79416905</link><guid>https://blog.youkuaiyun.com/a15666236/article/details/79416905</guid><author>a15666236</author><pubDate>Thu, 01 Mar 2018 20:20:14 +0800</pubDate><description><![CDATA[利用map 很水的一题结合2B学到的知识#include&amp;lt;bits/stdc++.h&amp;gt;using namespace std;char a[34];  int n[2005],m,maxi; int main()  {      map&amp;lt;string,int&amp;gt;map1,map2;  	scanf(&quot;%d&quot;,&amp;amp;m);      for(int i=0;i&amp;lt;m;+...]]></description><category></category></item><item><title><![CDATA[4A - Watermelon]]></title><link>https://blog.youkuaiyun.com/a15666236/article/details/79416745</link><guid>https://blog.youkuaiyun.com/a15666236/article/details/79416745</guid><author>a15666236</author><pubDate>Thu, 01 Mar 2018 20:01:00 +0800</pubDate><description><![CDATA[CF史上最水#include&amp;lt;stdio.h&amp;gt;main(){	int n;	scanf(&quot;%d&quot;,&amp;amp;n);	if(n&amp;gt;3&amp;amp;&amp;amp;(n&amp;amp;1)==0)puts(&quot;YES&quot;);else puts(&quot;NO&quot;);}]]></description><category></category></item><item><title><![CDATA[*codeforces 3A. Shortest path of the king模拟]]></title><link>https://blog.youkuaiyun.com/a15666236/article/details/79416638</link><guid>https://blog.youkuaiyun.com/a15666236/article/details/79416638</guid><author>a15666236</author><pubDate>Thu, 01 Mar 2018 19:47:44 +0800</pubDate><description><![CDATA[*codeforces 3A. Shortest path of the king模拟模拟即可#include&amp;lt;bits/stdc++.h&amp;gt;int main(){	char a[3],b[3];	scanf(&quot;%s%s&quot;,a,b);	int t,i,j,T;	t=abs(a[1]-'0'-(b[1]-'0'));	T=abs(a[0]-'a'-(b[0]-'a'));	if(t&amp;gt;...]]></description><category></category></item><item><title><![CDATA[Codeforces 2A - Winner模拟题]]></title><link>https://blog.youkuaiyun.com/a15666236/article/details/79416207</link><guid>https://blog.youkuaiyun.com/a15666236/article/details/79416207</guid><author>a15666236</author><pubDate>Thu, 01 Mar 2018 18:57:22 +0800</pubDate><description><![CDATA[这题，读懂题是关键。题意：找到最终结果时分数是最大的，当有多个时，找到值最先大于等于最大值的人过程：模拟俩次过程，第一次求最大值，第二次求最先到达者。我写了两个代码，均带有注释，第一个是不用map函数的直接模拟的适合初学者阅读，另外一个是用map函数的短小精炼 在第一个代码后面。      AC代码：#include&amp;lt;bits/stdc++.h&amp;gt;using namespace std;...]]></description><category></category></item><item><title><![CDATA[ACM 2018/3/1]]></title><link>https://blog.youkuaiyun.com/a15666236/article/details/79407313</link><guid>https://blog.youkuaiyun.com/a15666236/article/details/79407313</guid><author>a15666236</author><pubDate>Thu, 01 Mar 2018 00:53:35 +0800</pubDate><description><![CDATA[那么大的野心，这么点代码量怎么够。]]></description><category></category></item></channel></rss>