<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Safound的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Safound</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Safound]]></copyright><item><title><![CDATA[L2-030 冰岛人(map,并查集)]]></title><link>https://blog.youkuaiyun.com/Safound/article/details/104188125</link><guid>https://blog.youkuaiyun.com/Safound/article/details/104188125</guid><author>Safound</author><pubDate>Wed, 05 Feb 2020 20:50:22 +0800</pubDate><description><![CDATA[本题保证了不会出现同名的人，因此只需要保存名不需要保存姓，姓作为一个父亲结点保存，用map保存名所对应的编号，father数组保存父亲结点，然后用两个循环找寻结点，无奈最后一个测试点超时了，欢迎各位大佬指正
#include&lt;iostream&gt;
#include&lt;string&gt;
#include&lt;map&gt;
#include&lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[L2-029 特立独行的幸福 (25分)GPLT团体程序设计天梯赛]]></title><link>https://blog.youkuaiyun.com/Safound/article/details/104168508</link><guid>https://blog.youkuaiyun.com/Safound/article/details/104168508</guid><author>Safound</author><pubDate>Tue, 04 Feb 2020 13:23:09 +0800</pubDate><description><![CDATA[这道题最大的坑点居然是pow返回的是浮点型…一开始用pow怎样都不通过
用visit来记录幸福数，1为特立独行的幸福数，-1为不特立独行的幸福数
#include &lt;iostream&gt;
#include &lt;set&gt;
#include &lt;vector&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
using...]]></description><category></category></item></channel></rss>