<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[困兽犹斗]]></title><description><![CDATA[U had me at "hello"]]></description><link>https://blog.csdn.net/breakback</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; breakback]]></copyright><item><title><![CDATA[Geolocation software]]></title><link>https://blog.csdn.net/breakback/article/details/23330407</link><guid>https://blog.csdn.net/breakback/article/details/23330407</guid><author>breakback</author><pubDate>Thu, 10 Apr 2014 08:53:53 +0800</pubDate><description><![CDATA[In computing, geolocation software is used to deduce the geolocation (geographic location) of another party. For example, on the Internet, one geolocation approach is to identify the subject party's I]]></description><category></category></item><item><title><![CDATA[LSX Sand Washing Machine For Linux]]></title><link>https://blog.csdn.net/breakback/article/details/12746945</link><guid>https://blog.csdn.net/breakback/article/details/12746945</guid><author>breakback</author><pubDate>Tue, 15 Oct 2013 11:11:33 +0800</pubDate><description><![CDATA[inuxカーネルは、もとはIA-32アーキテクチャのCPUを搭載したPC/AT互換機専用として開発されたが、その後、他の多種多様なハードウェアプラットフォームにも移植されていった。カーネルについての詳細はLinuxカーネルの記事を参照。現在では特にサーバ、メインフレーム、スーパーコンピュータ用のOSとして首位を走っている。[2][3][4][5] 2010年10月現在、上位500のスーパーコンピュ]]></description><category></category></item><item><title><![CDATA[如何学习crusher语言]]></title><link>https://blog.csdn.net/breakback/article/details/12746357</link><guid>https://blog.csdn.net/breakback/article/details/12746357</guid><author>breakback</author><pubDate>Tue, 15 Oct 2013 10:34:20 +0800</pubDate><description><![CDATA[如何学习crusher语言



hello Crusher:
crusher = """ The HCS type cone crusher easy Maintenance with hydraulics adjustment and lifting.It will help you in many industries such as mining,building
 and c]]></description><category></category></item><item><title><![CDATA[HDU 2081]]></title><link>https://blog.csdn.net/breakback/article/details/7518381</link><guid>https://blog.csdn.net/breakback/article/details/7518381</guid><author>breakback</author><pubDate>Fri, 27 Apr 2012 21:52:43 +0800</pubDate><description><![CDATA[Problem Description
大家都知道，手机号是一个11位长的数字串，同时，作为学生，还可以申请加入校园网，如果加入成功，你将另外拥有一个短号。假设所有的短号都是是 6+手机号的后5位，比如号码为13512345678的手机，对应的短号就是645678。
现在，如果给你一个11位长的手机号码，你能找出对应的短号吗？
 


Input
输入数据的第一行是一个N(N]]></description><category></category></item><item><title><![CDATA[python 写个简单TUI日记本]]></title><link>https://blog.csdn.net/breakback/article/details/7518153</link><guid>https://blog.csdn.net/breakback/article/details/7518153</guid><author>breakback</author><pubDate>Fri, 27 Apr 2012 19:25:54 +0800</pubDate><description><![CDATA[logfunction.py:



#!/usr/bin/env python
#-*- coding:utf-8 -*-


import sys
import os
import time

def quit():
        sys.exit(0)

def writelog():
        name = time.strftime('%Y-%m-%d',time.loc]]></description><category></category></item><item><title><![CDATA[输出环境变量]]></title><link>https://blog.csdn.net/breakback/article/details/7518070</link><guid>https://blog.csdn.net/breakback/article/details/7518070</guid><author>breakback</author><pubDate>Fri, 27 Apr 2012 18:17:11 +0800</pubDate><description><![CDATA[#include 

extern char** environ;

int main() {
        char **var;
	for (var = environ; *var; ++var) 
		printf("%s\n",*var);
	return 0;
}]]></description><category></category></item><item><title><![CDATA[如何在你的电脑上禁用百度]]></title><link>https://blog.csdn.net/breakback/article/details/7517161</link><guid>https://blog.csdn.net/breakback/article/details/7517161</guid><author>breakback</author><pubDate>Fri, 27 Apr 2012 13:17:04 +0800</pubDate><description><![CDATA[将 /etc/hosts
改为
zoo@zoo:~/x$ cat /etc/hosts
127.0.0.1    localhost
127.0.1.1    zoo
127.0.0.2       www.baidu.com

# The following lines are desirable for IPv6 capable hosts
::1     localhost]]></description><category></category></item><item><title><![CDATA[BNU 1042]]></title><link>https://blog.csdn.net/breakback/article/details/7515931</link><guid>https://blog.csdn.net/breakback/article/details/7515931</guid><author>breakback</author><pubDate>Thu, 26 Apr 2012 21:25:19 +0800</pubDate><description><![CDATA[n=input()
for x in range(n):
        i=input()
        print pow(8,i)]]></description><category></category></item><item><title><![CDATA[Ackermann数]]></title><link>https://blog.csdn.net/breakback/article/details/7514535</link><guid>https://blog.csdn.net/breakback/article/details/7514535</guid><author>breakback</author><pubDate>Thu, 26 Apr 2012 15:33:26 +0800</pubDate><description><![CDATA[C++:

#include 
using namespace std;
long Ackermann(int m,int n);

int main()
{
    int loop,i,m,n;
    cin>>loop;
     for(i=1;i<=loop;i++)
    {
       cin>>m>>n;
       cout<< Ackermann(m,n)<<end]]></description><category></category></item><item><title><![CDATA[what's REPL]]></title><link>https://blog.csdn.net/breakback/article/details/7505619</link><guid>https://blog.csdn.net/breakback/article/details/7505619</guid><author>breakback</author><pubDate>Wed, 25 Apr 2012 18:45:36 +0800</pubDate><description><![CDATA[R: read
E: evaluated

P:printed

L:loop]]></description><category></category></item><item><title><![CDATA[sqrt]]></title><link>https://blog.csdn.net/breakback/article/details/7498290</link><guid>https://blog.csdn.net/breakback/article/details/7498290</guid><author>breakback</author><pubDate>Wed, 25 Apr 2012 16:04:34 +0800</pubDate><description><![CDATA[C:


#include 

#define Zero 1e-6

float mysqrt(int number) {
	
	float guess = 1.0f;
	float quotient = number/guess;
	float average = (guess + quotient)/2.0;
	
	do {
		guess = average;
		quotient =]]></description><category></category></item><item><title><![CDATA[写一个函数，参数是三个数，返回较大两个之和]]></title><link>https://blog.csdn.net/breakback/article/details/7497287</link><guid>https://blog.csdn.net/breakback/article/details/7497287</guid><author>breakback</author><pubDate>Wed, 25 Apr 2012 12:17:43 +0800</pubDate><description><![CDATA[scheme:




(define (bigsum a b c) 
(- (+ a b c) (min a b c)))
(bigsum 1 2 3)
(bigsum 2 3 3)
(bigsum 1 1 3)
(bigsum 1 2 1)
(bigsum 1 9 3)



python:




#!/usr/bin/env python

def bigsum]]></description><category></category></item><item><title><![CDATA[简单php笔记(一)]]></title><link>https://blog.csdn.net/breakback/article/details/7495203</link><guid>https://blog.csdn.net/breakback/article/details/7495203</guid><author>breakback</author><pubDate>Tue, 24 Apr 2012 20:56:35 +0800</pubDate><description><![CDATA[1.判断类型：


<?php

	$testing;
	$testing = 1;
	echo "testing is int?".is_int($testing);
	echo "";
	
	$testing = 0.5;
	echo "testing is float?".is_float($testing);
	echo "";
	
	$testing = 'abc';
	echo]]></description><category></category></item><item><title><![CDATA[写一个函数，有三个参数，判断是否有至少两个true值]]></title><link>https://blog.csdn.net/breakback/article/details/7493382</link><guid>https://blog.csdn.net/breakback/article/details/7493382</guid><author>breakback</author><pubDate>Tue, 24 Apr 2012 13:36:07 +0800</pubDate><description><![CDATA[(define (twoofthree x y z) (>= (+ x y z) 2))
(twoofthree 0 0 1)
(twoofthree 1 1 1)
(twoofthree 1 0 0)
(twoofthree 1 0 0)]]></description><category></category></item><item><title><![CDATA[perl hello]]></title><link>https://blog.csdn.net/breakback/article/details/7491685</link><guid>https://blog.csdn.net/breakback/article/details/7491685</guid><author>breakback</author><pubDate>Mon, 23 Apr 2012 22:40:31 +0800</pubDate><description><![CDATA[#!/usr/bin/env perl -w
$count = 1;
$times = 5;
while ($count <= $times) {
		print "hello " x $count;
		print "\n";
		$count += 1;
}]]></description><category></category></item><item><title><![CDATA[python 单链表]]></title><link>https://blog.csdn.net/breakback/article/details/7489317</link><guid>https://blog.csdn.net/breakback/article/details/7489317</guid><author>breakback</author><pubDate>Mon, 23 Apr 2012 13:32:34 +0800</pubDate><description><![CDATA[class Node:
	
	def __init__(self, cargo = None, next = None):
		self.cargo = cargo
		self.next = next
		
	def __str__(self):
		return str(self.cargo)
		
node1 = Node("one")
node2 = Node("two")
node1.n]]></description><category></category></item><item><title><![CDATA[python模拟静态类]]></title><link>https://blog.csdn.net/breakback/article/details/7489312</link><guid>https://blog.csdn.net/breakback/article/details/7489312</guid><author>breakback</author><pubDate>Mon, 23 Apr 2012 13:31:29 +0800</pubDate><description><![CDATA[#!/usr/bin/env python
#-*- coding:utf-8 -*-

# implement abstract class

def abstract():
    raise NotImplementedError("abstract")

class Person():

    def __init__(self):
        if self.__class__ i]]></description><category></category></item><item><title><![CDATA[python 建立最简单二叉树]]></title><link>https://blog.csdn.net/breakback/article/details/7489305</link><guid>https://blog.csdn.net/breakback/article/details/7489305</guid><author>breakback</author><pubDate>Mon, 23 Apr 2012 13:30:14 +0800</pubDate><description><![CDATA[#!/usr/bin/env python
#-*- coding:utf-8 -*-


class Tree:

	def __init__(self, cargo, left = None, right = None):
		self.cargo = cargo
		self.left = left
		self.right = right
	
	def __str__(self):
		r]]></description><category></category></item><item><title><![CDATA[python 打印矩阵]]></title><link>https://blog.csdn.net/breakback/article/details/7482430</link><guid>https://blog.csdn.net/breakback/article/details/7482430</guid><author>breakback</author><pubDate>Fri, 20 Apr 2012 18:03:08 +0800</pubDate><description><![CDATA[matrix = [[0,0,0,1,0],
		  [0,0,0,0,0],
		  [0,2,0,0,0],
		  [0,0,0,0,0],
		  [0,0,0,3,0]
		 ]
for i in matrix:
	print (i)
input()]]></description><category></category></item><item><title><![CDATA[以are结尾的四字单词]]></title><link>https://blog.csdn.net/breakback/article/details/7480910</link><guid>https://blog.csdn.net/breakback/article/details/7480910</guid><author>breakback</author><pubDate>Fri, 20 Apr 2012 12:46:55 +0800</pubDate><description><![CDATA[bare:
a. 1. 裸的 2. 光秃秃的 3. 空的 4. 无陈设的;无装饰的 5. 不加掩饰的 6. 勉强...


vt. 1. 使赤裸;露出 2. 揭露;透露 

[网络释义]

bare 1.暴露；赤裸的 2.光的，空白的 3.(部分的)赤裸 4.无反射层的，无屏蔽的 5.光秃的，裸露的
Bare 1.赤裸的 





care(就不解释了...)]]></description><category></category></item></channel></rss>