<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[CLManytime的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/CLManytime</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; CLManytime]]></copyright><item><title><![CDATA[汉诺塔IV]]></title><link>https://blog.youkuaiyun.com/CLManytime/article/details/79132505</link><guid>https://blog.youkuaiyun.com/CLManytime/article/details/79132505</guid><author>CLManytime</author><pubDate>Mon, 22 Jan 2018 19:33:46 +0800</pubDate><description><![CDATA[还记得汉诺塔III吗？他的规则是这样的：不允许直接从最左(右)边移到最右(左)边(每次移动一定是移到中间杆或从中间移出)，也不允许大盘放到小盘的上面。xhd在想如果我们允许最大的盘子放到最上面会怎么样呢？（只允许最大的放在最上面）当然最后需要的结果是盘子从小到大排在最右边。


Input 输入数据的第一行是一个数据T，表示有T组数据。 
每组数据有一个正整数n(1 
Output 对于]]></description><category></category></item><item><title><![CDATA[夹角有多大]]></title><link>https://blog.youkuaiyun.com/CLManytime/article/details/79132364</link><guid>https://blog.youkuaiyun.com/CLManytime/article/details/79132364</guid><author>CLManytime</author><pubDate>Mon, 22 Jan 2018 19:08:26 +0800</pubDate><description><![CDATA[时间过的好快，一个学期就这么的过去了，xhd在傻傻的看着表，出于对数据的渴望，突然他想知道这个表的时针和分针的夹角是多少。现在xhd知道的只有时间，请你帮他算出这个夹角。


注：夹角的范围[0，180]，时针和分针的转动是连续而不是离散的。 

Input 输入数据的第一行是一个数据T，表示有T组数据。 
每组数据有三个整数h(0 
Output 对于每组输入数据，输出夹角的大小的]]></description><category></category></item><item><title><![CDATA[Fibbonacci Number]]></title><link>https://blog.youkuaiyun.com/CLManytime/article/details/79132239</link><guid>https://blog.youkuaiyun.com/CLManytime/article/details/79132239</guid><author>CLManytime</author><pubDate>Mon, 22 Jan 2018 18:49:51 +0800</pubDate><description><![CDATA[Your objective for this question is to develop a program which will generate a fibbonacci number. The fibbonacci function is defined as such:


f(0) = 0 
f(1) = 1 
f(n) = f(n-1) + f(n-2) 

Your]]></description><category></category></item></channel></rss>