<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[phytn的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/phytn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; phytn]]></copyright><item><title><![CDATA[D的小L]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46793419</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46793419</guid><author>phytn</author><pubDate>Tue, 07 Jul 2015 19:34:04 +0800</pubDate><description><![CDATA[描述
      一天TC的匡匡找ACM的小L玩三国杀，但是这会小L忙着哩，不想和匡匡玩但又怕匡匡生气，这时小L给匡匡出了个题目想难倒匡匡(小L很D吧)，有一个数n(0，，，聪明的你能帮匡匡解围吗？




输入第一行输入一个数N（0
输出按特定顺序输出所有组合。
特定顺序：每一个组合中的值从小到大排列，组合之间按字典序排列。
样例输入
2
2
3

样例输出
12
21]]></description><category></category></item><item><title><![CDATA[众数问题]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46792617</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46792617</guid><author>phytn</author><pubDate>Tue, 07 Jul 2015 18:04:50 +0800</pubDate><description><![CDATA[描述

所谓众数，就是对于给定的含有N个元素的多重集合，每个元素在S中出现次数最多的成为该元素的重数，

多重集合S重的重数最大的元素成为众数。例如：S={1,2,2,2,3,5}，则多重集S的众数是2，其重数为3。

现在你的任务是：对于给定的由m个自然数组成的多重集S，计算出S的众数及其重数。




输入第一行为n，表示测试数据组数。(n
每组测试的第一行是一个整数m]]></description><category></category></item><item><title><![CDATA[比大小]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46788281</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46788281</guid><author>phytn</author><pubDate>Tue, 07 Jul 2015 13:27:43 +0800</pubDate><description><![CDATA[描述

给你两个很大的数，你能不能判断出他们两个数的大小呢？

比如123456789123456789要大于-123456




输入每组测试数据占一行，输入两个不超过1000位的10进制整数a,b
数据保证输入的a,b没有前缀的0。
如果输入0 0表示输入结束。测试数据组数不超过10组
输出如果a>b则输出“a>b”，如果a
样例输入
11111111111111]]></description><category></category></item><item><title><![CDATA[聪明的kk]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46764481</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46764481</guid><author>phytn</author><pubDate>Sun, 05 Jul 2015 17:59:22 +0800</pubDate><description><![CDATA[描述聪明的“KK”
非洲某国展馆的设计灵感源于富有传奇色彩的沙漠中陡然起伏的沙丘，体现出本国不断变换和绚丽多彩的自然风光与城市风貌。展馆由五部分组成，馆内影院播放名为《一眨眼的瞬间》的宽银幕短片，反映了建国以来人民生活水平和城市居住环境的惊人巨变。
可移动“沙丘”变戏法 的灵感源于其独特而雄伟的自然景观——富于传奇色彩的险峻沙丘。宏伟的结构、可循环的建材，与大自然相得益彰。环绕一周，发现它正是]]></description><category></category></item><item><title><![CDATA[蛇形填数]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46763431</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46763431</guid><author>phytn</author><pubDate>Sun, 05 Jul 2015 15:18:50 +0800</pubDate><description><![CDATA[描述 在n*n方陈里填入1,2,...,n*n,要求填成蛇形。例如n=4时方陈为：
10 11 12 1
9 16 13 2
8 15 14 3
7 6 5 4


输入 直接输入方陈的维数，即n的值。(n输出 输出结果是蛇形方陈。 样例输入 
3
样例输出 
7 8 1
6 9 2
5 4 3

#include
#include
#include
using names]]></description><category></category></item><item><title><![CDATA[卡片游戏]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46762239</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46762239</guid><author>phytn</author><pubDate>Sun, 05 Jul 2015 11:36:42 +0800</pubDate><description><![CDATA[桌上有一叠牌，从第一张牌（即位于顶面的牌）开始从上往下依次编号为1~n。当至少还剩两张牌时进行以下操作：把第一张牌扔掉，然后把新的第一张放到整叠牌的最后。输入n,输出每次扔掉的牌，以及最后剩下的牌。
输入：7
输出：
1 3 5 7 4 2 6 
#include
#include
using namespace std;
queue q;
int main()
{
	int n;
	sc]]></description><category></category></item><item><title><![CDATA[01串]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46762229</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46762229</guid><author>phytn</author><pubDate>Sun, 05 Jul 2015 11:34:06 +0800</pubDate><description><![CDATA[描述

ACM的zyc在研究01串，他知道某一01串的长度，但他想知道不含有“11”子串的这种长度的01串共有多少个，他希望你能帮帮他。

注：01串的长度为2时,有3种：00，01，10。




输入第一行有一个整数n（0
随后有n行，每行有一个整数m(2
输出输出不含有“11”子串的这种长度的01串共有多少个，占一行。
样例输入
2
2
3


样例输出
3
]]></description><category></category></item><item><title><![CDATA[超级台阶]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46762213</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46762213</guid><author>phytn</author><pubDate>Sun, 05 Jul 2015 11:32:59 +0800</pubDate><description><![CDATA[描述

有一楼梯共m级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第m级，共有多少走法？

注：规定从一级到一级有0种走法。


输入输入数据首先包含一个整数n(1
输出对于每个测试实例，请输出不同走法的数量。
样例输入
2
2
3

样例输出
1
2

来源[苗栋栋]原创
上传者苗栋栋
#include
#include
using namespace]]></description><category></category></item><item><title><![CDATA[The Triangle]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/46762181</link><guid>https://blog.youkuaiyun.com/phytn/article/details/46762181</guid><author>phytn</author><pubDate>Sun, 05 Jul 2015 11:28:44 +0800</pubDate><description><![CDATA[描述

7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends some]]></description><category></category></item><item><title><![CDATA[组合数]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45315475</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45315475</guid><author>phytn</author><pubDate>Mon, 27 Apr 2015 20:47:07 +0800</pubDate><description><![CDATA[描述
找出从自然数1、2、... 、n（0<n<10）中任取r(0<r<=n)个数的所有组合。




输入输入n、r。
输出按特定顺序输出所有组合。
特定顺序：每一个组合中的值从大到小排列，组合之间按逆字典序排列。
样例输入
5 3

样例输出
543
542
541
532
531
521
432
431
421
321


//这是关于dfs的，刚开始的是觉得]]></description><category></category></item><item><title><![CDATA[Encoding]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45251249</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45251249</guid><author>phytn</author><pubDate>Fri, 24 Apr 2015 20:46:00 +0800</pubDate><description><![CDATA[Problem Description
Given a string containing only 'A' - 'Z', we could encode it using the following method:


1. Each sub-string containing k same characters should be encoded to "kX" where "X" i]]></description><category></category></item><item><title><![CDATA[Least Common Multiple]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45251207</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45251207</guid><author>phytn</author><pubDate>Fri, 24 Apr 2015 20:43:39 +0800</pubDate><description><![CDATA[Problem Description
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 1]]></description><category></category></item><item><title><![CDATA[Digital Roots]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45250453</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45250453</guid><author>phytn</author><pubDate>Fri, 24 Apr 2015 19:15:08 +0800</pubDate><description><![CDATA[Problem Description
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin]]></description><category></category></item><item><title><![CDATA[Elevator]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45244325</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45244325</guid><author>phytn</author><pubDate>Fri, 24 Apr 2015 11:23:30 +0800</pubDate><description><![CDATA[Problem Description
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified ]]></description><category></category></item><item><title><![CDATA[Quoit Design]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45243779</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45243779</guid><author>phytn</author><pubDate>Fri, 24 Apr 2015 10:52:03 +0800</pubDate><description><![CDATA[Problem Description
Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the po]]></description><category></category></item><item><title><![CDATA[Number Sequence]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45193195</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45193195</guid><author>phytn</author><pubDate>Wed, 22 Apr 2015 11:51:34 +0800</pubDate><description><![CDATA[Problem Description
A number sequence is defined as follows:

f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.

Given A, B, and n, you are to calculate the value of f(n).

 

I]]></description><category></category></item><item><title><![CDATA[Let the Balloon Rise]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45192711</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45192711</guid><author>phytn</author><pubDate>Wed, 22 Apr 2015 11:21:29 +0800</pubDate><description><![CDATA[Problem Description
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest i]]></description><category></category></item><item><title><![CDATA[Max Sum]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/45192205</link><guid>https://blog.youkuaiyun.com/phytn/article/details/45192205</guid><author>phytn</author><pubDate>Wed, 22 Apr 2015 10:54:59 +0800</pubDate><description><![CDATA[Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +]]></description><category></category></item><item><title><![CDATA[Doing Homework again]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/41852017</link><guid>https://blog.youkuaiyun.com/phytn/article/details/41852017</guid><author>phytn</author><pubDate>Wed, 10 Dec 2014 21:02:18 +0800</pubDate><description><![CDATA[Description

Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the ho]]></description><category></category></item><item><title><![CDATA[Shopaholic]]></title><link>https://blog.youkuaiyun.com/phytn/article/details/41828119</link><guid>https://blog.youkuaiyun.com/phytn/article/details/41828119</guid><author>phytn</author><pubDate>Tue, 09 Dec 2014 19:57:51 +0800</pubDate><description><![CDATA[Description

Lindsay is a shopaholic. Whenever there is a discount of the kind where you can buy three items and only pay for two, she goes completely mad and feels a need to buy all items in the st]]></description><category></category></item></channel></rss>