<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fang_abc的专栏]]></title><description><![CDATA[本人菜鸟一枚，欢迎大家来我的博客空间拍砖！]]></description><link>https://blog.youkuaiyun.com/fang_abc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fang_abc]]></copyright><item><title><![CDATA[Python3爬取小说《昆仑》]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/62897145</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/62897145</guid><author>fang_abc</author><pubDate>Fri, 17 Mar 2017 20:21:54 +0800</pubDate><description><![CDATA[最近迷上小说，网上下载下来，发现章节缺少，重复等问题。严重影响了阅读体验，决定自己学着自己写代码爬一本小说来看。 
武侠小说《昆仑》 
第一章网址:     http://www.kanunu8.com/wuxia/201102/1718/38407.html  
最后一章网址: http://www.kanunu8.com/wuxia/201102/1718/38506.html  
talk i]]></description><category></category></item><item><title><![CDATA[online_judge_1503]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51318522</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51318522</guid><author>fang_abc</author><pubDate>Wed, 04 May 2016 22:00:39 +0800</pubDate><description><![CDATA[#include 

using namespace std;

struct BiTNode
{
    int data;
    BiTNode *left;
    BiTNode *right;
};
int loc;
int n;

BiTNode* createTree()
{
    cin>>loc;
    if(loc == 0)
    {
        return N]]></description><category></category></item><item><title><![CDATA[online_judge_1524]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51318476</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51318476</guid><author>fang_abc</author><pubDate>Wed, 04 May 2016 21:54:38 +0800</pubDate><description><![CDATA[#include 

using namespace std;

int main()
{
    int a[1001],b[1001],i,n;
    while(cin>>n)
    {
        a[0] = 0;
        for(i=1; i<=n; ++i)
            cin>>a[i];
        for(i=1; i<=n; ++i)
    ]]></description><category></category></item><item><title><![CDATA[online_judge_1252]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51312253</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51312253</guid><author>fang_abc</author><pubDate>Wed, 04 May 2016 09:24:36 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

int HuiWenMax(string &str)
{
    int len = str.size(),i;
    int s,e;
    int res = 1, t;
    for(i=1; i<len-1; ++i)
    {
        t = 0;
        s = i-1, e ]]></description><category></category></item><item><title><![CDATA[online_judge_1250]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51303107</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51303107</guid><author>fang_abc</author><pubDate>Tue, 03 May 2016 11:26:17 +0800</pubDate><description><![CDATA[#include 

using namespace std;

const int N = 10;
int a[N][N];
bool isChange(int n, int sumOld, int sumOven);
void init(int n, int &sumOld, int &sumOven);

int main()
{
    int n;
    int sumOld = 0,]]></description><category></category></item><item><title><![CDATA[online_judge_1249]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51302795</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51302795</guid><author>fang_abc</author><pubDate>Tue, 03 May 2016 10:53:12 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 

using namespace std;

const int M = 100100;
const int N = 1005;

struct E
{
    int s;
    int e;
    int cost;
    bool operator < (const E &e) cons]]></description><category></category></item><item><title><![CDATA[online_judge_1209]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51298121</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51298121</guid><author>fang_abc</author><pubDate>Mon, 02 May 2016 20:35:32 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

int main()
{
    int m,n;
    int a[21];
    int dp[101];
    int i,j;
    while(cin>>m>>n)
    {
        dp[0] = 0;
        for(i=1; i<=m; ++i)
        {
  ]]></description><category></category></item><item><title><![CDATA[online_judge_1208]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51297959</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51297959</guid><author>fang_abc</author><pubDate>Mon, 02 May 2016 20:08:15 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 

using namespace std;

int main()
{
    char str[1020];
    int a[1020],tBit[1020],res[1020];
    int aBit[4000];
    int len,lena,i,j,remain;
    bool isNotZer]]></description><category></category></item><item><title><![CDATA[hihoCoder_1273_海报清理]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/51106800</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/51106800</guid><author>fang_abc</author><pubDate>Sat, 09 Apr 2016 19:14:01 +0800</pubDate><description><![CDATA[这题在当时做的时候做不出来。后来参考网上大牛思想写的代码。大牛网址：http://blog.youkuaiyun.com/houxinssdut/article/details/50885954
#include 
#include 
#include 
#include 

using namespace std;

const int N = 1005;  //最多的海报数量
bool visit[N]]]></description><category></category></item><item><title><![CDATA[华为2016校园招聘上机笔试题]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50910765</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50910765</guid><author>fang_abc</author><pubDate>Thu, 17 Mar 2016 09:33:17 +0800</pubDate><description><![CDATA[老师想知道从某某同学当中，分数最高的是多少，现在请你编程模拟老师的询问。当然，老师有时候需要更新某位同学的成绩.
输入描述:
输入包括多组测试数据。
每组输入第一行是两个正整数N和M（0 
学生ID编号从1编到N。
第二行包含N个整数，代表这N个学生的初始成绩，其中第i个数代表ID为i的学生的成绩
接下来又M行，每一行有一个字符C（只取‘Q’或‘U’），和两个正整数A,B,当C为'Q']]></description><category></category></item><item><title><![CDATA[华为研发工程师]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50889899</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50889899</guid><author>fang_abc</author><pubDate>Mon, 14 Mar 2016 21:12:31 +0800</pubDate><description><![CDATA[有这样一道智力题：“某商店规定：三个空汽水瓶可以换一瓶汽水。小张手上有十个空汽水瓶，她最多可以换多少瓶汽水喝？”答案是5瓶，方法如下：先用9个空瓶子换3瓶汽水，喝掉3瓶满的，喝完以后4个空瓶子，用3个再换一瓶，喝掉这瓶满的，这时候剩2个空瓶子。然后你让老板先借给你一瓶汽水，喝掉这瓶满的，喝完以后用3个空瓶子换一瓶满的还给老板。如果小张手上有n个空汽水瓶，最多可以换多少瓶汽水喝？


#inc]]></description><category></category></item><item><title><![CDATA[2016网易研发工程师]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50889842</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50889842</guid><author>fang_abc</author><pubDate>Mon, 14 Mar 2016 21:06:29 +0800</pubDate><description><![CDATA[小易经常沉迷于网络游戏.有一次,他在玩一个打怪升级的游戏,他的角色的初始能力值为 a.在接下来的一段时间内,他将会依次遇见n个怪物,每个怪物的防御力为b1,b2,b3...bn. 如果遇到的怪物防御力bi小于等于小易的当前能力值c,那么他就能轻松打败怪物,并
 且使得自己的能力值增加bi;如果bi大于c,那他也能打败怪物,但他的能力值只能增加bi 与c的最大公约数.那么问题来了,在一系列的锻炼后]]></description><category></category></item><item><title><![CDATA[蘑菇街2016研发工程师_回文串]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50889824</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50889824</guid><author>fang_abc</author><pubDate>Mon, 14 Mar 2016 21:01:12 +0800</pubDate><description><![CDATA[给定一个字符串，问是否能通过添加一个字母将其变为回文串。


#include 
#include 
#include 

using namespace std;

bool isHuiWen(char *str)
{
    int len = strlen(str);
    bool ans = true;
    int i;
    for(i=0; i<len/2; ++i)
]]></description><category></category></item><item><title><![CDATA[蘑菇街2016研发工程师_投篮游戏]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50889817</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50889817</guid><author>fang_abc</author><pubDate>Mon, 14 Mar 2016 21:00:18 +0800</pubDate><description><![CDATA[有一个投篮游戏。球场有p个篮筐，编号为0，1...，p-1。每个篮筐下有个袋子，每个袋子最多装一个篮球。有n个篮球，每个球编号xi 。规则是将数字为xi 的篮球投到xi 除p的余数为编号的袋里。若袋里已有篮球则球弹出游戏结束输出i，否则重复至所有球都投完。输出-1。问游戏最终的输出是什么？


#include 

using namespace std;

int main()
{
   ]]></description><category></category></item><item><title><![CDATA[蘑菇街2016研发工程师_聊天]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50889802</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50889802</guid><author>fang_abc</author><pubDate>Mon, 14 Mar 2016 20:59:19 +0800</pubDate><description><![CDATA[A和B是好友，他们经常在空闲时间聊天，A的空闲时间为[a1 ,b1 ],[a2 ,b2 ]..[ap ,bp ]。B的空闲时间是[c1 +t,d1 +t]..[cq +t,dq +t],这里t为B的起床时间。这些时间包括了边界点。B的起床时间为[l,r]的一个时刻。若一个起床时间能使两人在任意时刻聊天，那么这个时间就是合适的，问有多少个合适的起床时间？



#include 
using]]></description><category></category></item><item><title><![CDATA[蘑菇街2016研发工程师_最大间隔]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50889776</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50889776</guid><author>fang_abc</author><pubDate>Mon, 14 Mar 2016 20:57:01 +0800</pubDate><description><![CDATA[给定一个递增序列，a1 2 n 。定义这个序列的最大间隔为d=max{ai+1 -
 ai }(1≤i2 ,a3 ..an-1 中删除一个元素。问剩余序列的最大间隔最小是多少？



#include 

using namespace std;

int main()
{
    int a[101];
    int i,tmax,tmin,n;
    while(cin>>n)
]]></description><category></category></item><item><title><![CDATA[蘑菇街2016研发工程师_搬圆桌]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50889757</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50889757</guid><author>fang_abc</author><pubDate>Mon, 14 Mar 2016 20:55:12 +0800</pubDate><description><![CDATA[现在有一张半径为r的圆桌，其中心位于(x,y)，现在他想把圆桌的中心移到(x1,y1)。每次移动一步，都必须在圆桌边缘固定一个点然后将圆桌绕这个点旋转。问最少需要移动几步。


#include 
#include 

using namespace std;

int main()
{
    double d;
    long long x1,x2,y1,y2;
    long lo]]></description><category></category></item><item><title><![CDATA[onlien_judge_1368]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50866853</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50866853</guid><author>fang_abc</author><pubDate>Sat, 12 Mar 2016 18:42:52 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

using namespace std;

struct BiTNode
{
    int data;
    int index;
    int leftnode,rightnode;
};

void createTree(BiTNode *T, int n)
{
    int i,t;
    for(i=1; i<=n; ]]></description><category></category></item><item><title><![CDATA[online_judge_1367]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50858611</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50858611</guid><author>fang_abc</author><pubDate>Fri, 11 Mar 2016 20:27:17 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

bool isTreeOf(int *a, int s, int e)
{
    int len = e - s + 1;
    int root = a[e];
    int i,mid;
    bool left, right;
    if(len<=2)
        return true;
]]></description><category></category></item><item><title><![CDATA[online_judge_1523]]></title><link>https://blog.youkuaiyun.com/fang_abc/article/details/50858524</link><guid>https://blog.youkuaiyun.com/fang_abc/article/details/50858524</guid><author>fang_abc</author><pubDate>Fri, 11 Mar 2016 20:06:44 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

using namespace std;

struct BiTNode
{
    int data;
    int left;
    int right;
    bool isRoot;
};

int createTree(BiTNode a[], int n)
{
    int i;
    char c;
    fo]]></description><category></category></item></channel></rss>