<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Fighting_Yanx的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Fighting_Yanx</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Fighting_Yanx]]></copyright><item><title><![CDATA[UVA 490 Rotating Sentences]]></title><link>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47672555</link><guid>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47672555</guid><author>Fighting_Yanx</author><pubDate>Sat, 15 Aug 2015 00:35:14 +0800</pubDate><description><![CDATA[UVA 490 Rotating Sentences题意：将n（n<100）行字符串顺时针旋转90度输出，每行字符数少于100个。Sample Input:
  Rene Decartes once said, 
  “I think, therefore I am.”
Sample Output:
  “R 
  Ie 
   n 
  te 
  h  
  iD 
  ne 
  kc]]></description><category></category></item><item><title><![CDATA[UVA 694 The Collatz Sequence]]></title><link>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47617335</link><guid>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47617335</guid><author>Fighting_Yanx</author><pubDate>Thu, 13 Aug 2015 19:34:36 +0800</pubDate><description><![CDATA[UVA 694 The Collatz Sequence题意：输入一个数A（A<2147483647）,和一个上限limit，进行以下步骤： 
Step１: 
任选一个正整数Ａ作为这个数列的第一项。 
**Step２: 
如果Ａ＝１则停止。** 
Step３: 
如果Ａ为偶数，则Ａ＝Ａ／２然后重新回到Step２。 
Step４: 
如果Ａ为奇数，则Ａ＝３*Ａ＋１然后重新回到Step２。Sample]]></description><category></category></item><item><title><![CDATA[UVA 445 Marvelous Mazes]]></title><link>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47483877</link><guid>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47483877</guid><author>Fighting_Yanx</author><pubDate>Thu, 13 Aug 2015 01:18:19 +0800</pubDate><description><![CDATA[UVA 445 Marvelous Mazes题意：输入一段字符串，输出时有如下要求。当a[i]=’！�%�%�R0则输出 换行（\n）。若为数字，如s[i]=2 s[i+1]=’T’,则输出TT。若为连续数字则将数字累加，如 s[i]=1,s[i+1]=2,s[i+2]=T.则输出 TTT。若数字后接的s[i+1]=’b’ ,则输出多个空格（‘ ’）。Sample Input： 
<1T1b5T!1T2b1]]></description><category></category></item><item><title><![CDATA[UVA 494 Kindergarten Counting Game]]></title><link>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47476643</link><guid>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47476643</guid><author>Fighting_Yanx</author><pubDate>Thu, 13 Aug 2015 00:53:21 +0800</pubDate><description><![CDATA[UVA 494 Kindergarten Counting Game题意：输出多组一句话，统计有多少个单词。Sample Input: 
//UVA 494
//Kindergarten Counting Game
//by Yanx
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    char a[10]]></description><category></category></item><item><title><![CDATA[UVA 458  The Decoder]]></title><link>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47474745</link><guid>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47474745</guid><author>Fighting_Yanx</author><pubDate>Thu, 13 Aug 2015 00:47:51 +0800</pubDate><description><![CDATA[UVA 458  The Decoder题意：根据样例输入输出破译字符串 加密原理。Sample Input：
  1JKJ’pz’{ol’{yhklthyr’vm’{ol’Jvu{yvs’Kh{h’Jvywvyh{pvu5 
  1PIT’pz’h’{yhklthyr’vm’{ol’Pu{lyuh{pvuhs’I|zpulzz’Thjopul’Jvywvyh{pvu5 
  1KLJ’pz’{ol]]></description><category></category></item><item><title><![CDATA[UVA 10055 Hashmat the Brave Warrior]]></title><link>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47469343</link><guid>https://blog.youkuaiyun.com/Fighting_Yanx/article/details/47469343</guid><author>Fighting_Yanx</author><pubDate>Thu, 13 Aug 2015 00:32:19 +0800</pubDate><description><![CDATA[UVA 10055 Hashmat the Brave Warrior题意：给出两个整数n,m（n<2^32,m<2^32），分别代表Hashmat 士兵的数量 或者 敌方士兵的数量（己方士兵数量大于敌方），你的任务是输出 两方士兵数量的差值，每个结果单独占一行。 
Sample Input:
  10 12 
      10 14 
      100 200
Sample Output:]]></description><category></category></item></channel></rss>