<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[loulina的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/llnou</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; llnou]]></copyright><item><title><![CDATA[hdu2052 Picture]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38499629</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38499629</guid><author>llnou</author><pubDate>Mon, 11 Aug 2014 21:33:14 +0800</pubDate><description><![CDATA[Problem Description

Give you the width and height of the rectangle,darw it.

 


Input

Input contains a number of test cases.For each case ,there are two numbers n and m (0 

 


Outpu]]></description><category></category></item><item><title><![CDATA[hdu2050 折线分割平面]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38498071</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38498071</guid><author>llnou</author><pubDate>Mon, 11 Aug 2014 20:30:55 +0800</pubDate><description><![CDATA[Problem Description

我们看到过很多直线分割平面的题目，今天的这个题目稍微有些变化，我们要求的是n条折线分割平面的最大数目。比如，一条折线可以将平面分成两部分，两条折线最多可以将平面分成7部分，具体如下所示。


 


Input

输入数据的第一行是一个整数C,表示测试实例的个数，然后是C 行数据，每行包含一个整数n(0



 


Ou]]></description><category></category></item><item><title><![CDATA[hdu1004Let the Balloon Rise]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38434609</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38434609</guid><author>llnou</author><pubDate>Fri, 08 Aug 2014 09:39:07 +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[hdu2550 百步穿杨]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38401049</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38401049</guid><author>llnou</author><pubDate>Wed, 06 Aug 2014 14:50:31 +0800</pubDate><description><![CDATA[Problem Description
时维九月,序属三秋,辽军大举进攻MCA山,战场上两军正交锋.辽军统帅是名噪一时的耶律-James,而MCA方则是派出了传统武将中草药123.双方经过协商,约定在十一月八日正午十分进行射箭对攻战.中草药123早早就开始准备,但是他是武将而不是铁匠,造弓箭的活就交给聪明能干的你了,现在告诉你每种弓箭规格,即箭身的长度,以及每种规格弓箭所需要的数目,要求你把需要]]></description><category></category></item><item><title><![CDATA[hdu2025 查找最大元素]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38390447</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38390447</guid><author>llnou</author><pubDate>Tue, 05 Aug 2014 20:49:42 +0800</pubDate><description><![CDATA[Problem Description
对于输入的每个字符串，查找其中的最大字母，在该字母后面插入字符串“(max)”。

 

Input
输入数据包括多个测试实例，每个实例由一行长度不超过100的字符串组成，字符串仅由大小写字母构成。

 

Output
对于每个测试实例输出一行字符串，输出的结果是插入字符串“(max)”后的结果，如果存在多个最大的字母，就在每一个最大]]></description><category></category></item><item><title><![CDATA[hdu2028 Lowest Common Multiple Plus]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38385533</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38385533</guid><author>llnou</author><pubDate>Tue, 05 Aug 2014 14:54:40 +0800</pubDate><description><![CDATA[源代码：
#include
int fun(int m,int n)
{
 int i;
 for(i=m;;i++)
  if(i%m==0&&i%n==0) break;
 return i;
}
int main()
{
 int n,m,i,k;
 while(scanf("%d",&n)!=EOF)
 {
  k=1;
        for(i=0;i
]]></description><category></category></item><item><title><![CDATA[hdu2040 亲和数]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38385467</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38385467</guid><author>llnou</author><pubDate>Tue, 05 Aug 2014 14:51:47 +0800</pubDate><description><![CDATA[Problem Description

古希腊数学家毕达哥拉斯在自然数研究中发现，220的所有真约数(即不是自身的约数)之和为： 

1+2+4+5+10+11+20+22+44+55+110＝284。 

而284的所有真约数为1、2、4、71、 142，加起来恰好为220。人们对这样的数感到很惊奇，并称之为亲和数。一般地讲，如果两个数中任何一个数都是另一个数的真约数之和，则这两个]]></description><category></category></item><item><title><![CDATA[hdu2030 汉字统计]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38382721</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38382721</guid><author>llnou</author><pubDate>Tue, 05 Aug 2014 11:19:52 +0800</pubDate><description><![CDATA[#include
#include
int main()
{
    int n,i,k;
    char a[1000];
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        gets(a);
        k=0;
        for(i=0;i
        if(a[i]
  ]]></description><category></category></item><item><title><![CDATA[hdu2029 Palindromes _easy version]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38382127</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38382127</guid><author>llnou</author><pubDate>Tue, 05 Aug 2014 10:55:32 +0800</pubDate><description><![CDATA[Problem Description
“回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。请写一个程序判断读入的字符串是否是“回文”。
 

Input
输入包含多个测试实例，输入数据的第一行是一个正整数n,表示测试实例的个数，后面紧跟着是n个字符串。

 

Output
如果一个字符串是回文串，则输出"yes",否则输出"no".]]></description><category></category></item><item><title><![CDATA[hdu1196 Lowest Bit]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38379513</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38379513</guid><author>llnou</author><pubDate>Tue, 05 Aug 2014 09:13:42 +0800</pubDate><description><![CDATA[Problem Description
Given an positive integer A (1 

For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.

Another example g]]></description><category></category></item><item><title><![CDATA[hdu2032 杨辉三角]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38379267</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38379267</guid><author>llnou</author><pubDate>Tue, 05 Aug 2014 08:57:28 +0800</pubDate><description><![CDATA[Problem Description
还记得中学时候学过的杨辉三角吗？具体的定义这里不再描述，你可以参考以下的图形：
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1

 

Input
输入数据包含多个测试实例，每个测试实例的输入只包含一个正整数n（1
 

Output
对应于每一个输入，请输出相应层数的杨辉三角，每一层的]]></description><category></category></item><item><title><![CDATA[hdu2022 海选女主角]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38366687</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38366687</guid><author>llnou</author><pubDate>Mon, 04 Aug 2014 11:02:43 +0800</pubDate><description><![CDATA[Problem Description
potato老师虽然很喜欢教书，但是迫于生活压力，不得不想办法在业余时间挣点外快以养家糊口。
“做什么比较挣钱呢？筛沙子没力气，看大门又不够帅...”potato老师很是无奈。
“张艺谋比你还难看，现在多有钱呀，听说还要导演奥运开幕式呢！你为什么不去娱乐圈发展呢？”lwg在一旁出主意。
嗯，也是，为了生存，就委屈点到娱乐圈混混吧，马上就拍一部激光电影]]></description><category></category></item><item><title><![CDATA[hdu2021 发工资咯：）]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38366319</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38366319</guid><author>llnou</author><pubDate>Mon, 04 Aug 2014 10:38:25 +0800</pubDate><description><![CDATA[Problem Description
作为杭电的老师，最盼望的日子就是每月的8号了，因为这一天是发工资的日子，养家糊口就靠它了，呵呵
但是对于学校财务处的工作人员来说，这一天则是很忙碌的一天，财务处的小胡老师最近就在考虑一个问题：如果每个老师的工资额都知道，最少需要准备多少张人民币，才能在给每位老师发工资的时候都不用老师找零呢？
这里假设老师的工资都是正整数，单位元，人民币一共有100元、]]></description><category></category></item><item><title><![CDATA[hdu2015 偶数求和]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38365963</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38365963</guid><author>llnou</author><pubDate>Mon, 04 Aug 2014 10:21:10 +0800</pubDate><description><![CDATA[Problem Description
有一个长度为n(n
 

Input
输入数据有多组，每组占一行，包含两个正整数n和m，n和m的含义如上所述。

 

Output
对于每组输入数据，输出一个平均值序列，每组输出占一行。

 

Sample Input

3 2
4 2

 

Sample Output

3 6
3 7]]></description><category></category></item><item><title><![CDATA[hdu2088 Box of Bricks]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38337793</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38337793</guid><author>llnou</author><pubDate>Fri, 01 Aug 2014 15:49:47 +0800</pubDate><description><![CDATA[Problem Description
Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I've built a wall!”, he tells his older sister A]]></description><category></category></item><item><title><![CDATA[hdu2098 分拆素数和]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38323349</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38323349</guid><author>llnou</author><pubDate>Thu, 31 Jul 2014 20:58:29 +0800</pubDate><description><![CDATA[Problem Description
把一个偶数拆成两个不同素数的和，有几种拆法呢？
 

Input
输入包含一些正的偶数，其值不会超过10000，个数不会超过500，若遇0，则结束。
 

Output
对应每个偶数，输出其拆成不同素数的个数，每个结果占一行。
 

Sample Input

30
26
0

 

Sample Output

]]></description><category></category></item><item><title><![CDATA[hdu2099 整除的尾数]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38322721</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38322721</guid><author>llnou</author><pubDate>Thu, 31 Jul 2014 20:16:02 +0800</pubDate><description><![CDATA[Problem Description
一个整数，只知道前几位，不知道末二位，被另一个整数除尽了，那么该数的末二位该是什么呢？
 

Input
输入数据有若干组，每组数据包含二个整数a，b（0
 

Output
对应每组数据，将满足条件的所有尾数在一行内输出，格式见样本输出。同组数据的输出，其每个尾数之间空一格，行末没有空格。
 

Sample Input

20]]></description><category></category></item><item><title><![CDATA[hdu2000 ASCII码排序]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38314039</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38314039</guid><author>llnou</author><pubDate>Thu, 31 Jul 2014 11:09:10 +0800</pubDate><description><![CDATA[Problem Description
输入三个字符后，按各字符的ASCII码从小到大的顺序输出这三个字符。
 

Input
输入数据有多组，每组占一行，有三个字符组成，之间无空格。
 

Output
对于每组输入数据，输出一行，字符中间用一个空格分开。
 

Sample Input

qwe
asd
zxc

 

Sample Output

]]></description><category></category></item><item><title><![CDATA[hdu1002 A + B Problem II]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38303961</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38303961</guid><author>llnou</author><pubDate>Wed, 30 Jul 2014 17:26:40 +0800</pubDate><description><![CDATA[Problem Description
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

 

Input
The first line of the input contains an integer T(1<=T<]]></description><category></category></item><item><title><![CDATA[hdu1021 Fibonacci Again]]></title><link>https://blog.youkuaiyun.com/llnou/article/details/38272951</link><guid>https://blog.youkuaiyun.com/llnou/article/details/38272951</guid><author>llnou</author><pubDate>Tue, 29 Jul 2014 16:50:37 +0800</pubDate><description><![CDATA[Problem Description
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).

 

Input
Input consists of a sequence of lines, each containing an integer n]]></description><category></category></item></channel></rss>