<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zf______的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zf______</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zf______]]></copyright><item><title><![CDATA[Ubuntu 下 vim 搭建python 环境 配置]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/69264192</link><guid>https://blog.youkuaiyun.com/zf______/article/details/69264192</guid><author>zf______</author><pubDate>Wed, 05 Apr 2017 17:05:17 +0800</pubDate><description><![CDATA[1. 安装完整的vim
# apt-get install vim-gnome
2. 安装ctags，ctags用于支持taglist，必需！
# apt-get install ctags
3. 安装taglist
#apt-get install vim-scripts
#apt-get install vim-addon-manager
# vim-addons install]]></description><category></category></item><item><title><![CDATA[强制显示U盘隐藏文件]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/69261694</link><guid>https://blog.youkuaiyun.com/zf______/article/details/69261694</guid><author>zf______</author><pubDate>Wed, 05 Apr 2017 16:35:30 +0800</pubDate><description><![CDATA[在确认U盘中病毒已经清除的情况下，不管是WIN7还是XP，均可以通过运行CMD调出命令提示符窗口之后，运行attrib
 -h -s x:\*.* /S /D命令，恢复U盘中所有文件和文件的显示。（用U盘的实际盘符来代替命令行中的X。）命令行中，-h
 -s表示去除文件和文件夹的隐藏和系统属性，而/S参数则代表处理当前文件夹及其所有子文件夹中的匹配文件，/D参数表示也处理文件夹。]]></description><category></category></item><item><title><![CDATA[sdn配置教程  ——从零开始搞sdn]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/53174260</link><guid>https://blog.youkuaiyun.com/zf______/article/details/53174260</guid><author>zf______</author><pubDate>Tue, 15 Nov 2016 17:58:21 +0800</pubDate><description><![CDATA[sdn配置教程
——从零开始搞sdn
（注：本文只介绍在计算机中安装ubuntu虚拟机及环境配置，不涉及安装双系统。有兴趣安装双系统的同学可以自行研究，环境配置方面基本相同，只在初始安装系统方面有些许不同。）
sdn需要wireshark、mininet、floodlight等软件。但是在运行这些软件之前，你首先要有一个ubuntu的操作系统。本文采用ubuntu
 16.04 TCL系统]]></description><category></category></item><item><title><![CDATA[Linux更新Python版本及修改python默认版本的方法]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/53174223</link><guid>https://blog.youkuaiyun.com/zf______/article/details/53174223</guid><author>zf______</author><pubDate>Tue, 15 Nov 2016 17:55:51 +0800</pubDate><description><![CDATA[本人在学习sdn过程中，安装的python版本较低。很多语句不支持，为了更新python版本和修改默认版本，特写本文。有需要的朋友可以参考下。
 
1、从官网下载python安装包（这个版本可以是任意版本3.3 2.7 2.6等等，本文以2.7为例）
wget http://python.org/ftp/python/2.7/Python-2.7.tar.bz2 
 2、解压并安装
依次]]></description><category></category></item><item><title><![CDATA[HDU 1421 搬寝室]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/47023463</link><guid>https://blog.youkuaiyun.com/zf______/article/details/47023463</guid><author>zf______</author><pubDate>Thu, 23 Jul 2015 15:57:33 +0800</pubDate><description><![CDATA[搬寝室
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u



Description

搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,]]></description><category></category></item><item><title><![CDATA[HDU 2845 Beans]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/47007801</link><guid>https://blog.youkuaiyun.com/zf______/article/details/47007801</guid><author>zf______</author><pubDate>Wed, 22 Jul 2015 18:58:02 +0800</pubDate><description><![CDATA[Beans
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with differ]]></description><category></category></item><item><title><![CDATA[HDU 1300 Pearls]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/47007753</link><guid>https://blog.youkuaiyun.com/zf______/article/details/47007753</guid><author>zf______</author><pubDate>Wed, 22 Jul 2015 18:44:38 +0800</pubDate><description><![CDATA[Pearls
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

In Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a l]]></description><category></category></item><item><title><![CDATA[HDU 2571 命运]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/47007449</link><guid>https://blog.youkuaiyun.com/zf______/article/details/47007449</guid><author>zf______</author><pubDate>Wed, 22 Jul 2015 18:33:56 +0800</pubDate><description><![CDATA[命运
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u



Description

穿过幽谷意味着离大魔王lemon已经无限接近了！ 
可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机关。要知道，不论何人，若在迷]]></description><category></category></item><item><title><![CDATA[HDU 2050 折线分割平面]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46970627</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46970627</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 16:52:51 +0800</pubDate><description><![CDATA[折线分割平面
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

我们看到过很多直线分割平面的题目，今天的这个题目稍微有些变化，我们要求的是n条折线分割平面的最大数目。比如，一条折线可以将平面分成两部分，两条折线最多可以将平面分成7部分，具体如下所]]></description><category></category></item><item><title><![CDATA[HDU 2604 Queuing]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46970179</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46970179</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 16:31:36 +0800</pubDate><description><![CDATA[Queuing
Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status




Description

Queues and Priority Queues are data structures which are known to most co]]></description><category></category></item><item><title><![CDATA[HDU 1575 Tr A]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46970017</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46970017</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 16:24:53 +0800</pubDate><description><![CDATA[Tr A
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。 

 




Input

数据的第一行是一个T，表示有T组数据。 ]]></description><category></category></item><item><title><![CDATA[HDU	4979 A simple math problem.]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46969047</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46969047</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 15:36:30 +0800</pubDate><description><![CDATA[A Simple Math Problem
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u



Description

Lele now is thinking about a simple function f(x). 

If x 
If x >= 10 f(x) ]]></description><category></category></item><item><title><![CDATA[HDU 2018 母牛的故事]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46968903</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46968903</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 15:34:13 +0800</pubDate><description><![CDATA[母牛的故事
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

有一头母牛，它每年年初生一头小母牛。每头小母牛从第四个年头开始，每年年初也生一头小母牛。请编程实现在第n年的时候，共有多少头母牛？
 




Input

输入数据由]]></description><category></category></item><item><title><![CDATA[HDU 2041 超级楼梯]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46968631</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46968631</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 15:17:37 +0800</pubDate><description><![CDATA[超级楼梯
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

有一楼梯共M级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第M级，共有多少种走法？
 




Input

输入数据首先包含一个整数N，表示测试实例的个数，然]]></description><category></category></item><item><title><![CDATA[HDU 2032 杨辉三角]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46968563</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46968563</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 15:08:23 +0800</pubDate><description><![CDATA[杨辉三角
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice HDU
 2032




Description

还记得中学时候学过的杨辉三角吗？具体的定义这里不再描述，你可以参考以下的图形： 
1 
1 1 
1 2 ]]></description><category></category></item><item><title><![CDATA[HDU 2047 阿牛的EOF牛肉串]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46968273</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46968273</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 14:53:09 +0800</pubDate><description><![CDATA[阿牛的EOF牛肉串
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

今年的ACM暑期集训队一共有18人，分为6支队伍。其中有一个叫做EOF的队伍，由04级的阿牛、XC以及05级的COY组成。在共同的集训生活中，大家建立了深厚的友谊，阿牛准备做点]]></description><category></category></item><item><title><![CDATA[HDU2044 一只小蜜蜂...]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46968005</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46968005</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 14:37:57 +0800</pubDate><description><![CDATA[一只小蜜蜂...
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice HDU
 2044




Description

有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房，不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。]]></description><category></category></item><item><title><![CDATA[HDU 2289 Cup]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46967827</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46967827</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 14:27:11 +0800</pubDate><description><![CDATA[Cup
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume ]]></description><category></category></item><item><title><![CDATA[HDU 2578 Dating with girls(1)]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46967667</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46967667</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 14:13:48 +0800</pubDate><description><![CDATA[Dating with girls(1)
Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u



Description

Everyone in the HDU knows that the number of boys is larger than the number o]]></description><category></category></item><item><title><![CDATA[POJ 2785 4 Values whose Sum is 0]]></title><link>https://blog.youkuaiyun.com/zf______/article/details/46967549</link><guid>https://blog.youkuaiyun.com/zf______/article/details/46967549</guid><author>zf______</author><pubDate>Mon, 20 Jul 2015 14:06:02 +0800</pubDate><description><![CDATA[4 Values whose Sum is 0
Time Limit:15000MS     Memory Limit:228000KB     64bit IO Format:%I64d
 & %I64u



Description


The SUM problem can be formulated as follows: given four lists A, B, C]]></description><category></category></item></channel></rss>