<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dream_hunter]]></title><description><![CDATA[All is for the love!]]></description><link>https://blog.youkuaiyun.com/Gavintop</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Gavintop]]></copyright><item><title><![CDATA[kaggle--Titanic学习]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/79619879</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/79619879</guid><author>Gavintop</author><pubDate>Tue, 20 Mar 2018 00:36:01 +0800</pubDate><description><![CDATA[# -*-coding:utf-8-*-
import pandas as pd
import numpy as np
import matplotlib.pyplot as plt
from pylab import *


#2.1各乘客等级的获救情况
def survived_by_pclass(data_train):
    
    #fig = plt.figure()
    #f...]]></description><category></category></item><item><title><![CDATA[tensorflow学习笔记：偏微分方程]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/79124270</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/79124270</guid><author>Gavintop</author><pubDate>Sun, 21 Jan 2018 23:55:05 +0800</pubDate><description><![CDATA[# -*- coding:utf-8 -*-
#偏微分方程
import tensorflow as tf
import numpy as np

import PIL.Image
from io import StringIO
from IPython.display import clear_output, Image, display

def DisplayArray(a, fmt='jp]]></description><category></category></item><item><title><![CDATA[tensorflow学习笔记： 曼德布洛特(MANDELBROT)集]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/79123981</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/79123981</guid><author>Gavintop</author><pubDate>Sun, 21 Jan 2018 22:55:42 +0800</pubDate><description><![CDATA[# -*- coding:utf-8 -*-
# 曼德布罗特集合
# 导入仿真库
import tensorflow as tf
import numpy as np

# 导入可视化库
#若使用anaconda安装pil，则会在import tensorflow时提示错误，因此直接将PIL包安装在lib目录下
import PIL.Image
# 2.7上面是from StringIO,3.6上]]></description><category></category></item><item><title><![CDATA[tensorflow学习笔记（MNIST-2）]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/79091315</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/79091315</guid><author>Gavintop</author><pubDate>Thu, 18 Jan 2018 00:01:14 +0800</pubDate><description><![CDATA[# -*- coding:utf-8 -*-
# "-*- coding:utf-8 -*-" 定义源代码的编码格式，#
from tensorflow.python.platform import gfile
from tensorflow.contrib.learn.python.learn.datasets.mnist import extract_images
from tensorflo]]></description><category></category></item><item><title><![CDATA[tensorflow学习笔记（MNIST）]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/79070306</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/79070306</guid><author>Gavintop</author><pubDate>Tue, 16 Jan 2018 00:40:20 +0800</pubDate><description><![CDATA[# -*- coding:utf-8 -*-
# "-*- coding:utf-8 -*-" 定义源代码的编码格式，#
from tensorflow.python.platform import gfile
from tensorflow.contrib.learn.python.learn.datasets.mnist import extract_images
from tensorflo]]></description><category></category></item><item><title><![CDATA[Windows下配置Python GUI的tab补齐功能]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/74905797</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/74905797</guid><author>Gavintop</author><pubDate>Sun, 09 Jul 2017 20:37:55 +0800</pubDate><description><![CDATA[思路：在Python启动之前加入readline,rlcompleter；
#python startup file
import sys
import readline
import rlcompleter
import atexit
import os
#tab completion
readline.parse_and_bind('tab: complete')
#history file]]></description><category></category></item><item><title><![CDATA[IP地址判断有效性]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/50806356</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/50806356</guid><author>Gavintop</author><pubDate>Fri, 04 Mar 2016 23:37:35 +0800</pubDate><description><![CDATA[判断输入的字符串是否为合法IP
合法IP即为*.*.*.*形式，不允许出现前置0，之间不能有空格，每一段的数字在0-255之间，字符串前后允许有空格
#include 
#include "OJ.h"
#include 
#include 
#include 
using namespace std;
bool isIPAddressValid(const char* pszIPAddr)
{]]></description><category></category></item><item><title><![CDATA[24点游戏算法]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/50784410</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/50784410</guid><author>Gavintop</author><pubDate>Wed, 02 Mar 2016 23:42:30 +0800</pubDate><description><![CDATA[给4个1到10的数，然后这4个数能否经过加减乘除后得到24枚举所有组合即可首先枚举4个数字的排列，然后对于每一个排列，枚举运算符#include 
#include "OJ.h"
#include 
#include 
#include 
using namespace std;
bool dfs(int nums[], int index, int sum)
{
    if(index >= ]]></description><category></category></item><item><title><![CDATA[openSUSE下交叉编译boost库]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/49833773</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/49833773</guid><author>Gavintop</author><pubDate>Sat, 14 Nov 2015 11:03:33 +0800</pubDate><description><![CDATA[（所有操作在root下）
1.环境
交叉编译工具：arm-linux-4.4.4(4.4.4_09.06.2010)
编译平台：Linux version 3.16.6-2-desktop
开发板：ARM, EABI5 version 1 (SYSV)
boost版本：boost_1_59_0(http://sourceforge.net/projects/boost/files/boost/1.]]></description><category></category></item><item><title><![CDATA[去哪儿2013笔试编程]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/48596693</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/48596693</guid><author>Gavintop</author><pubDate>Sun, 20 Sep 2015 14:23:34 +0800</pubDate><description><![CDATA[题意：给定一个整形数组，对这个整形数组排序，使得按序拼接成的值最小。如【3,83,8,13,1】->【1,13,3,83,8】
思路：先根据每个数的第一个数字大小排序【（13,1），（3），（83,8）】，然后再分组排序【（1,13），（3），（83,8）】。分组排序时位数不够补当前第一位的值（83,8）比较转化为（83,88）比较。
#include
#include
#include
#i]]></description><category></category></item><item><title><![CDATA[求组合数]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/38118139</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/38118139</guid><author>Gavintop</author><pubDate>Fri, 25 Jul 2014 14:57:53 +0800</pubDate><description><![CDATA[由费马小定理,对于质数p及0]]></description><category></category></item><item><title><![CDATA[分块_莫队算法]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/25345507</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/25345507</guid><author>Gavintop</author><pubDate>Thu, 08 May 2014 23:59:48 +0800</pubDate><description><![CDATA[题意：

给定N个数,记为ai(1i<=
 N),求区间内某两个数和为给定的M的对数。一共Q次询问



数据范围：
T
N
1 ai
Q]]></description><category></category></item><item><title><![CDATA[hdu4638莫队算法]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/25345033</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/25345033</guid><author>Gavintop</author><pubDate>Thu, 08 May 2014 23:54:02 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[hdu1553Going Home]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/25166151</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/25166151</guid><author>Gavintop</author><pubDate>Wed, 07 May 2014 00:03:44 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[C++ Integer Limits]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/24887589</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/24887589</guid><author>Gavintop</author><pubDate>Fri, 02 May 2014 21:46:56 +0800</pubDate><description><![CDATA[http://msdn.microsoft.com/en-us/library/7fh3a000]]></description><category></category></item><item><title><![CDATA[C. Sereja and Swaps/优先队列]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/24633845</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/24633845</guid><author>Gavintop</author><pubDate>Mon, 28 Apr 2014 12:58:41 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[hdu1385]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/24335001</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/24335001</guid><author>Gavintop</author><pubDate>Wed, 23 Apr 2014 00:34:31 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[Coder-Strike 2014 - Round 2]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/24205363</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/24205363</guid><author>Gavintop</author><pubDate>Mon, 21 Apr 2014 00:05:43 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[Coder-Strike 2014 - Round 1]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/24150609</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/24150609</guid><author>Gavintop</author><pubDate>Sun, 20 Apr 2014 00:40:36 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[fzu2038]]></title><link>https://blog.youkuaiyun.com/Gavintop/article/details/21337233</link><guid>https://blog.youkuaiyun.com/Gavintop/article/details/21337233</guid><author>Gavintop</author><pubDate>Sun, 16 Mar 2014 20:43:58 +0800</pubDate><description><![CDATA[http://acm.fzu.edu.cn/problem.php?pid=2038
题意:告诉一个图的权值,求从任一点到所有点的权值之和
dfs按个点搜肯定t,可以计算每条边经过的次数(次数=边的左边的点数)
注意最后的和很大,long long 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
]]></description><category></category></item></channel></rss>