<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Matrix_Reloaded的专栏]]></title><description><![CDATA[不懈的努力，辉煌的人生！]]></description><link>https://blog.youkuaiyun.com/Matrix_Reloaded</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Matrix_Reloaded]]></copyright><item><title><![CDATA[Switching From Windows to Nix or a Newbie to Linux – 20 Useful Commands for Linux Newbies]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/40615471</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/40615471</guid><author>Matrix_Reloaded</author><pubDate>Thu, 30 Oct 2014 10:21:48 +0800</pubDate><description><![CDATA[So you are planning to switch from Windows to Linux, or have just switched to
Linux? Oops!!! what I am asking! For what else reason would you have been here. From my past experience when I was new to]]></description><category></category></item><item><title><![CDATA[Linux新手大礼包：学习Linux你必须知道的那些事儿]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/40615319</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/40615319</guid><author>Matrix_Reloaded</author><pubDate>Thu, 30 Oct 2014 10:14:43 +0800</pubDate><description><![CDATA[Linux新手大礼包：学习Linux你必须知道的那些事儿






linux

linux内核 
开放源代码 
开源大讲堂 
操作系统 
欢迎加入Linux的大家庭！对你来说，这可能还是一个陌生的领域，不过相信随着逐步深入的了解，你会喜欢上Linux，喜欢上开源的！首先，让我们来看一下，Linux新手应该注意和了解哪些事情吧！

欢迎加入Linux的大家庭！对你来]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1081. Rational Sum (20)]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/37583457</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/37583457</guid><author>Matrix_Reloaded</author><pubDate>Tue, 08 Jul 2014 23:42:54 +0800</pubDate><description><![CDATA[模拟题


#pragma warning (disable:4786)
#include
#include
#include
#include
#include
#include
#include
using namespace std;

long long int sum,ans,sum1;
int n;
struct Node
{
    long long int numerato]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1010. Radix (25)]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/35880933</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/35880933</guid><author>Matrix_Reloaded</author><pubDate>Mon, 30 Jun 2014 00:28:22 +0800</pubDate><description><![CDATA[Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and 110 is a binary number.

Now for any pair of positive ]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1070. Mooncake (25)]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/35844157</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/35844157</guid><author>Matrix_Reloaded</author><pubDate>Sun, 29 Jun 2014 22:33:35 +0800</pubDate><description><![CDATA[Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional mooncakes according to the region's culture. Now ]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1065. A+B and C (64bit) (20)]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/33452007</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/33452007</guid><author>Matrix_Reloaded</author><pubDate>Mon, 23 Jun 2014 00:11:24 +0800</pubDate><description><![CDATA[Given three integers A, B and C in [-263, 263], you are supposed to tell whether A+B > C.

Input Specification:

The first line of the input gives the positive number of test cases, T (

Output ]]></description><category></category></item><item><title><![CDATA[HDU 2203 亲和串  (想法题，字符串处理)]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/32151577</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/32151577</guid><author>Matrix_Reloaded</author><pubDate>Wed, 18 Jun 2014 17:55:30 +0800</pubDate><description><![CDATA[给定两个字符串s1和s2,如果能通过s1循环移位，使s2包含在s1中，那么我们就说s2 是s1的亲和串。
将S1+S1
#include
#include
#include
#include
#include
using namespace std;

int main()
{
    string s1,s2;
    while(cin>>s1)
    {
        cin>>s2]]></description><category></category></item><item><title><![CDATA[树状数组题集[不断更新]]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/32101509</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/32101509</guid><author>Matrix_Reloaded</author><pubDate>Wed, 18 Jun 2014 11:40:26 +0800</pubDate><description><![CDATA[一. 基本原理



树状数组中用的d【】，每个点都有一定的管辖范围；

如c[1]=a[1];

d[2]=a[1]+a[2];

d[3]=a[3];

d[4]=a[1]+a[2]+a[3]+a[4];

等等；

这样的结构关键是为了，对一个数组内部动态的删除，增加，来高效的求某个点或者某个区间的值；

比如说对数组a，改变某一位的值需O（1），求某个k]]></description><category></category></item><item><title><![CDATA[HDU 1982 Kaitou Kid - The Phantom Thief (1)]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/31074139</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/31074139</guid><author>Matrix_Reloaded</author><pubDate>Sun, 15 Jun 2014 22:59:10 +0800</pubDate><description><![CDATA[/*注意###--##类似的重复处理，同HDU 1062相似，直接使用2次串流可能会导致PE

#include
#include
#include
#include
#include
using namespace std;

void process(string s)
{
    replace(s.begin(),s.end(),'-',' ');
    stringstream m(s]]></description><category></category></item><item><title><![CDATA[HDU 1062 Text Reverse  字符串处理]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/31040549</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/31040549</guid><author>Matrix_Reloaded</author><pubDate>Sun, 15 Jun 2014 21:39:13 +0800</pubDate><description><![CDATA[//注意，本题目不能用chuanliu#include
#include
#include
#include
#include
using namespace std;

void run(){
    string s,t;
    getline(cin,s);
    stringstream m(s);

        int cnt=0;
        while(m>>t)
   ]]></description><category></category></item><item><title><![CDATA[Linux系统管理入门(1)]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/24523125</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/24523125</guid><author>Matrix_Reloaded</author><pubDate>Sat, 26 Apr 2014 12:07:15 +0800</pubDate><description><![CDATA[Linux系统安装、系统设置及基本操作]]></description><category></category></item><item><title><![CDATA[CodingTrip - 携程编程大赛 （预赛第一场）第二题 括号匹配]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/23390169</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/23390169</guid><author>Matrix_Reloaded</author><pubDate>Thu, 10 Apr 2014 22:32:58 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define rep(i, n) for(int i]]></description><category></category></item><item><title><![CDATA[CodingTrip - 携程编程大赛 （预赛第一场）第三题 携程全球数据中心建设]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/23389451</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/23389451</guid><author>Matrix_Reloaded</author><pubDate>Thu, 10 Apr 2014 22:23:10 +0800</pubDate><description><![CDATA[//球面上2点的距离   #include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

const double pi = 3.14159265358979323846;
double d,r,sum,cur,n;

struct node {
    double j, w;
	node(){}]]></description><category></category></item><item><title><![CDATA[CodingTrip - 携程编程大赛 （预赛第一场）第四题]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/23389215</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/23389215</guid><author>Matrix_Reloaded</author><pubDate>Thu, 10 Apr 2014 22:19:35 +0800</pubDate><description><![CDATA[//注意数据范围#include 
#include 
#include 
#include 
using namespace std;

unsigned __int64  a[110];  //unsigned __int64正数范围是 __int64的2倍
int id;
int tt[100];

void run()
{
    unsigned __int64 m;
    int n]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1078. Hashing (25) 浙大2014年上机复试第二题]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22920459</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22920459</guid><author>Matrix_Reloaded</author><pubDate>Fri, 04 Apr 2014 11:03:45 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;

const int MaxN=20001;

int n,m;
bool Position[MaxN];

void special_process(int cur)
{
    for(int i=1; i<m; i++)
    {
        int po]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1080. Graduate Admission (30) 浙大2014年上机复试第四题]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22914793</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22914793</guid><author>Matrix_Reloaded</author><pubDate>Fri, 04 Apr 2014 09:37:32 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;

const int maxn=40005;
const int maxm=101;

int n,m,k;
int num[maxm];
int lastRank[maxm];

vector mm[maxm];

struct stu
{
    int id;
    int G]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1079. Total Sales of Supply Chain (25) 浙大2014年上机复试第三题]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22881909</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22881909</guid><author>Matrix_Reloaded</author><pubDate>Thu, 03 Apr 2014 16:49:00 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;

struct Node
{
    int parent;  //父节点
    bool flag;  //是否是retailers
    int level;   //第几层
    int num;    //销售多少个
};
Node tt[100005];

int n;
double p,r,sum;

]]></description><category></category></item><item><title><![CDATA[ZJU-PAT 1077. Kuchiguse (20) 浙大2014年上机复试第一题]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22849107</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/22849107</guid><author>Matrix_Reloaded</author><pubDate>Thu, 03 Apr 2014 09:32:15 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;

string longest_common_suffix(string a,string b)
{
	string tmp="";
	int len1=a.size()-1;
	int len2=b.size()-1;

	while(len1>=0 && len2>=0)
	{
	]]></description><category></category></item><item><title><![CDATA[如何在 Eclipse 中使用命令行]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/9128311</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/9128311</guid><author>Matrix_Reloaded</author><pubDate>Wed, 19 Jun 2013 14:11:06 +0800</pubDate><description><![CDATA[虽然我们已经有了像 Eclipse 这样高级的 IDE，但是我们有时候也是需要在开发的时候使用 Windows 的命令行，来运行一些独立的程序。在两个程序中切换来切换去是很麻烦的。所以 Eclipse 提供了这样的工具，让我们在 Eclipse 中使用 Windows 命令行。 

第一步：设置一个新的外部配置工具 
在 Eclipse 中，选择 “Run -> External Tools]]></description><category></category></item><item><title><![CDATA[Google工程师详述Google的搜索结果排列算法[选摘]]]></title><link>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/8928314</link><guid>https://blog.youkuaiyun.com/Matrix_Reloaded/article/details/8928314</guid><author>Matrix_Reloaded</author><pubDate>Tue, 14 May 2013 23:55:25 +0800</pubDate><description><![CDATA[本文作者马特-卡兹（Matt Cutts）是Google公司品质管理部门的软件工程师。他的工作主要是给好的网站评定等级，并负责开发阻止虚假或垃圾网站出现在Google搜索结果上的技术。

图书馆管理员们提出最多的问题之一是：“对于什么样的结果应该位于搜索列表的最上方，Google是如何选择的？”

现在品质工程师马特-卡兹介绍了快速入门的知识，解释了Google是如何在网上爬行和索引，以及]]></description><category></category></item></channel></rss>