<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a_ppler的专栏]]></title><description><![CDATA[努力，明天会更好！]]></description><link>https://blog.youkuaiyun.com/a_ppler</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a_ppler]]></copyright><item><title><![CDATA[火星文 wa]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/17199999</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/17199999</guid><author>a_ppler</author><pubDate>Sun, 08 Dec 2013 13:27:17 +0800</pubDate><description><![CDATA[#include
#include
#include
int SS[100];
int q=0;
void ss()
{
 int k=0,f,i,j;
 for(i=2;i
 {
  f=1;
  k=(int)sqrt(i);
  for(j=2;j
  {
   if(i%j==0)
   {
    f=0;
    break;
   }
  }
]]></description><category></category></item><item><title><![CDATA[HDU 1686 Oulipo]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/16898113</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/16898113</guid><author>a_ppler</author><pubDate>Sat, 23 Nov 2013 11:38:05 +0800</pubDate><description><![CDATA[Problem Description
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:

Tout avait Pa]]></description><category></category></item><item><title><![CDATA[HDU 1051 Wooden Sticks (贪心，嵌套区间个数 )]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/12113633</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/12113633</guid><author>a_ppler</author><pubDate>Fri, 27 Sep 2013 23:29:34 +0800</pubDate><description><![CDATA[Wooden Sticks 
Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 1   Accepted Submission(s) : 1
Font: Times New Roman | Verdana | Georgia 
Font]]></description><category></category></item><item><title><![CDATA[HDU 1052 Tian Ji -- The Horse Racing]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/12029929</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/12029929</guid><author>a_ppler</author><pubDate>Wed, 25 Sep 2013 21:51:21 +0800</pubDate><description><![CDATA[Problem Description
Here is a famous story in Chinese history.

"That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king an]]></description><category></category></item><item><title><![CDATA[HDU 4731 Minimum palindrome 找规律 (2013 ACM/ICPC Asia Regional Chengdu Online 1004)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/11749895</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/11749895</guid><author>a_ppler</author><pubDate>Mon, 16 Sep 2013 23:14:53 +0800</pubDate><description><![CDATA[//比赛中自己少考虑一种情况,下面参考大牛的思路。上自己的代码。/*
	题意，用前m个字母，组成长度为n的字符串，使得子串中回文数最小
	当m=1时，必定全是a。
	当m>2时，必定全是abc循环，因为要构成回文，回文中左右端点相同，且第二级相同。举例证明：
a的右边必定是b，a的左边必定是c。所以含a的必定不能成回文。而不含a的只有bc，所以abc循环回文数最小。
	当m=2时，思考用上述m>2]]></description><category></category></item><item><title><![CDATA[HDU 1050 Moving Tables （贪心，注意细节）]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/11717351</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/11717351</guid><author>a_ppler</author><pubDate>Mon, 16 Sep 2013 00:59:36 +0800</pubDate><description><![CDATA[Moving Tables
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15528    Accepted Submission(s): 5348


Problem Description
The famous ACM]]></description><category></category></item><item><title><![CDATA[HDU1009 FatMouse' Trade]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/11714197</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/11714197</guid><author>a_ppler</author><pubDate>Sun, 15 Sep 2013 21:26:01 +0800</pubDate><description><![CDATA[FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34583    Accepted Submission(s): 11314


Problem Description
FatMouse pre]]></description><category></category></item><item><title><![CDATA[HDU 1800 Flying to the Mars (贪心)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/11536815</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/11536815</guid><author>a_ppler</author><pubDate>Tue, 10 Sep 2013 19:48:31 +0800</pubDate><description><![CDATA[Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8651    Accepted Submission(s): 2823


Problem Description



In th]]></description><category></category></item><item><title><![CDATA[HDU 1257 最少拦截系统 (贪心---求最长递减序列（不连续的）)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/11487095</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/11487095</guid><author>a_ppler</author><pubDate>Mon, 09 Sep 2013 17:58:21 +0800</pubDate><description><![CDATA[最少拦截系统
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13559 Accepted Submission(s): 5414


Problem Description
某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是]]></description><category></category></item><item><title><![CDATA[HDU 2037 今年暑假不AC  (贪心---求最多不相交区间问题)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/11355255</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/11355255</guid><author>a_ppler</author><pubDate>Sat, 07 Sep 2013 21:49:44 +0800</pubDate><description><![CDATA[Problem Description
“今年暑假不AC？”
“是的。”
“那你干什么呢？”
“看世界杯呀，笨蛋！”
“@#$%^&*%...”

确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。
作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，比如新闻联播（永远不要忘记关心国家大事）、非常6+7、超级]]></description><category></category></item><item><title><![CDATA[计算二进制中1的个数]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10947193</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10947193</guid><author>a_ppler</author><pubDate>Mon, 02 Sep 2013 19:45:02 +0800</pubDate><description><![CDATA[问题描述
任意给定一个32位无符号整数n，求n的二进制表示中1的个数，比如n = 5（0101）时，返回2，n = 15（1111）时，返回4
这也是一道比较经典的题目了，相信不少人面试的时候可能遇到过这道题吧，下面介绍了几种方法来实现这道题，相信很多人可能见过下面的算法，但我相信很少有人见到本文中所有的算法。如果您上头上有更好的算法，或者本文没有提到的算法，请不要吝惜您的代码，分享的时候，也]]></description><category></category></item><item><title><![CDATA[2013暑假江西联合训练赛（赛后）  二进制求和 (树状数组，这里需要变形下)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10947097</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10947097</guid><author>a_ppler</author><pubDate>Mon, 02 Sep 2013 19:43:03 +0800</pubDate><description><![CDATA[Problem Description
平时我们经常会将一个数用二进制的形式来表示，我们用 BSUM（X） 表示X用二进制形式表示中1的个数。现在给你一个长度为n (n
1 a b (1
2 a b (1
3 a b (1
Input
第一行输入T（
每组测试先输入一行n，下一行输入n个数a[i]（1
然后输入q表示询问次数
接下来q行代表每次询问。 
Sample Input]]></description><category></category></item><item><title><![CDATA[HDU 2492   Ping pong  (树状数组+离散化+找规律)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10299097</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10299097</guid><author>a_ppler</author><pubDate>Sun, 25 Aug 2013 12:49:50 +0800</pubDate><description><![CDATA[Problem Description
N(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment).


Each player has a unique skill rank. To improve their skill rank, they]]></description><category></category></item><item><title><![CDATA[HDU 2139 Calculate the formula公式 1^2+3^2+5^2+...+(2n-1)^2 ==n*(n+1)*(n+2)/6]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10252697</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10252697</guid><author>a_ppler</author><pubDate>Sat, 24 Aug 2013 10:08:45 +0800</pubDate><description><![CDATA[Problem Description
You just need to calculate the sum of the formula: 1^2+3^2+5^2+……+ n ^2.


Input
In each case, there is an odd positive integer n.


Output
Print the sum. Make sure the su]]></description><category></category></item><item><title><![CDATA[HDU 2136 Largest prime factor]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10251007</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10251007</guid><author>a_ppler</author><pubDate>Sat, 24 Aug 2013 09:35:04 +0800</pubDate><description><![CDATA[Problem Description
Everybody knows any number can be combined by the prime number.
Now, your task is telling me what position of the largest prime factor.
The position of prime 2 is 1, prime 3 is ]]></description><category></category></item><item><title><![CDATA[HDU 2133 What day is it（给定日期求星期几）]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10211439</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10211439</guid><author>a_ppler</author><pubDate>Fri, 23 Aug 2013 10:30:55 +0800</pubDate><description><![CDATA[Problem Description
Today is Saturday, 17th Nov,2007. Now, if i tell you a date, can you tell me what day it is ?



Input
There are multiply cases.
One line is one case.
There are three integ]]></description><category></category></item><item><title><![CDATA[HDU 1541 Stars (树状数组)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10191569</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10191569</guid><author>a_ppler</author><pubDate>Thu, 22 Aug 2013 17:32:47 +0800</pubDate><description><![CDATA[Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and]]></description><category></category></item><item><title><![CDATA[HDU 2642 Stars(二维树状数组)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10190771</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10190771</guid><author>a_ppler</author><pubDate>Thu, 22 Aug 2013 17:19:36 +0800</pubDate><description><![CDATA[Problem Description
Yifenfei is a romantic guy and he likes to count the stars in the sky.
To make the problem easier,we considerate the sky is a two-dimension plane.Sometimes the star will be brigh]]></description><category></category></item><item><title><![CDATA[HDU 1892 See you~(经典二维树状数组)]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10190249</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10190249</guid><author>a_ppler</author><pubDate>Thu, 22 Aug 2013 17:09:23 +0800</pubDate><description><![CDATA[Problem Description
Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good friends. I want to say sorry to Mr, ]]></description><category></category></item><item><title><![CDATA[HDU 2114 Calculate S(n) （公式）]]></title><link>https://blog.youkuaiyun.com/a_ppler/article/details/10169717</link><guid>https://blog.youkuaiyun.com/a_ppler/article/details/10169717</guid><author>a_ppler</author><pubDate>Thu, 22 Aug 2013 09:01:50 +0800</pubDate><description><![CDATA[Problem Description
Calculate S(n).

S(n)=13+23 +33 +......+n3 .


Input
Each line will contain one integer N(1 


Output
For each case, output the last four dights of S(N) in one line.

]]></description><category></category></item></channel></rss>