<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[心在路上]]></title><description><![CDATA[笔记]]></description><link>https://blog.youkuaiyun.com/binary001</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; binary001]]></copyright><item><title><![CDATA[HDU 1711 Number Sequence(KMP入门)]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8257358</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8257358</guid><author>binary001</author><pubDate>Tue, 04 Dec 2012 20:24:36 +0800</pubDate><description><![CDATA[Number Sequence
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6786    Accepted Submission(s): 3084



Problem Description

Given two]]></description><category></category></item><item><title><![CDATA[HDU 1056  HangOver]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244495</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244495</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:22:09 +0800</pubDate><description><![CDATA[#include 
int main(int argc, char *argv[])
{
    int i;
    double n,sum;
    while(scanf("%lf",&n)!=EOF)
    {
        if(n==0) break;
        for(i=2,sum=0; sum<n; i++)
            sum+=1.0/i;]]></description><category></category></item><item><title><![CDATA[HDU 1097  Ignatius's puzzle]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244440</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244440</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:13:48 +0800</pubDate><description><![CDATA[Problem Description
Ignatius is poor at math,he falls across apuzzle problem,so he has no choice but to appeal to Eddy. this problemdescribes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative integerk]]></description><category></category></item><item><title><![CDATA[HDU 1097 A hard puzzle]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244425</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244425</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:11:33 +0800</pubDate><description><![CDATA[解题思路：本题和最右边数类似，找规律，四个一循环
/*A hard puzzle*/

#include 
using namespace std;
int main(int argc, char *argv[])
{
    int m,n;
    int a,b,c,d;
    while(cin>>m>>n)
    {
        a=m%10;
        b=(a*a)%]]></description><category></category></item><item><title><![CDATA[HDU 1087 Super Jumping! Jumping! Jumping!]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244417</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244417</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:10:13 +0800</pubDate><description><![CDATA[题目大意：跳格子，约束条件是，下一步格子的数比上一步格子的数要大。
解题思路：典型的最长有序子序列，并记录各个序列的sum，输出最大的sum；
 
/*hdu1087*/
#include 
#define nMax 1024

typedef struct data
{
    long n;
    long sum;
};

struct data a[nMax];

int main]]></description><category></category></item><item><title><![CDATA[HDU 1062 Text Reverse]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244398</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244398</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:07:42 +0800</pubDate><description><![CDATA[字符串的倒置，注意字符串接受和个别细节就ok了，接受cas的时候，下面接受字符用getchar（）接受换行符，否则换行符会当输入数据接收的。
 
#include 
#include 
#include 
#define nMax 1024
using namespace std;

string s1;
char s[nMax];
char c;
int main(int argc, cha]]></description><category></category></item><item><title><![CDATA[HDU 1061 Rightmost Digit]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244388</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244388</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:06:25 +0800</pubDate><description><![CDATA[解题思路：看到N的范围，可以断定本题是找规律的，可以从最小的2的1次方到4次方，2,4,8,16，其最右边数分别是2,4,5,6，可以看出，任意M>=2的数的N次方，会在4次以内有循环。
 
#include
int main()
{
    int n,i,j,k,l;
    long m;
    scanf("%d",&n);
    while(n--)
    {]]></description><category></category></item><item><title><![CDATA[HDU 1045 Fire Net]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244372</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244372</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:05:18 +0800</pubDate><description><![CDATA[题目大意：放置炮台，两个炮台在同行或者同列，则不能直接摆置，中间要有墙才能放置；
解题思路：用dfs找出每种摆置炮台的方法，记录最多炮塔数，本题的图规格比较小，所以dfs耗时不高。
/*HDU 1045 Fire Net*/
#include 
#include 
#include 
using namespace std;

char gmap[4][4];
int maxNum=0;
in]]></description><category></category></item><item><title><![CDATA[HDU 1035 RobotMotion]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244354</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244354</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 17:01:24 +0800</pubDate><description><![CDATA[题目大意：机器人走迷宫，给定一张地图，机器人根据地图的方向走，能走出地图的则输出走过的步数，循环走的，根据题目输出循环走前的步数以及循环走的步数
解题思路：dfs模拟机器人走；
/*Robot Motion*/
#include 
#include 
using namespace std;

int row,col,start;
char gmap[11][11];
int visit[11]]></description><category></category></item><item><title><![CDATA[HDU 1027 Ignatiusand the Princess II]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244320</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244320</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 16:56:08 +0800</pubDate><description><![CDATA[Ignatiusand the Princess II
Time Limit: 2000/1000 MS (Java/Others)    MemoryLimit: 65536/32768 K (Java/Others)
Total Submission(s): 2675    Accepted Submission(s): 1622



Problem Description
N]]></description><category></category></item><item><title><![CDATA[HDU 1021 FibonacciAgain]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244306</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244306</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 16:54:29 +0800</pubDate><description><![CDATA[FibonacciAgain
Time Limit: 2000/1000 MS (Java/Others)    MemoryLimit: 65536/32768 K (Java/Others)
Total Submission(s): 21563    Accepted Submission(s): 10360



Problem Description
There areano]]></description><category></category></item><item><title><![CDATA[HDU 1004 Let the Balloon Rise]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244212</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244212</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 16:42:15 +0800</pubDate><description><![CDATA[Letthe Balloon Rise
Time Limit: 2000/1000 MS (Java/Others)    MemoryLimit: 65536/32768 K (Java/Others)
Total Submission(s): 44096    Accepted Submission(s): 15575



Problem Description
Contest]]></description><category></category></item><item><title><![CDATA[HDU 1020 Encoding]]></title><link>https://blog.youkuaiyun.com/binary001/article/details/8244165</link><guid>https://blog.youkuaiyun.com/binary001/article/details/8244165</guid><author>binary001</author><pubDate>Fri, 30 Nov 2012 16:37:12 +0800</pubDate><description><![CDATA[Encoding
Time Limit: 2000/1000 MS (Java/Others)    MemoryLimit: 65536/32768 K (Java/Others)
Total Submission(s): 16720    Accepted Submission(s): 7132



Problem Description
Givena string conta]]></description><category></category></item></channel></rss>