<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/reliveyy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; reliveyy]]></copyright><item><title><![CDATA[shell脚本笔记（二）Condition Evaluation Utility]]></title><link>https://blog.youkuaiyun.com/reliveyy/article/details/42934799</link><guid>https://blog.youkuaiyun.com/reliveyy/article/details/42934799</guid><author>reliveyy</author><pubDate>Tue, 20 Jan 2015 23:51:24 +0800</pubDate><description><![CDATA[格式：test expression 或者 [ expression ]
返回：0表达式为真，1表达式为假或者缺少表达式，大于1表示发生错误
一、测试文件
例如：test -e dummy.txt
-e 存在

文件类型
-b block
-c character
-d directory
-f exist & regular
-p named pipe (FIFO)
-L]]></description><category></category></item><item><title><![CDATA[shell脚本笔记（一）]]></title><link>https://blog.youkuaiyun.com/reliveyy/article/details/42932827</link><guid>https://blog.youkuaiyun.com/reliveyy/article/details/42932827</guid><author>reliveyy</author><pubDate>Tue, 20 Jan 2015 22:46:06 +0800</pubDate><description><![CDATA[变量
定义一个变量：a=123（等号前后不能有空格）$var 或者 ${var}第二种表示有必要吗？num=2echo $numnd # 错误echo ${num}nd # 正确所以，脚本空格很重要。$(cmd)等同于`cmd`,脚本会执行cmd并将结果替换整个表达式(包括cmd外面）环境变量PATHexport PATH=/usr/local/sbin:$PATH
参数
脚本可以看做是命令]]></description><category></category></item><item><title><![CDATA[HDU 1171 Big Event in HDU（多重背包）]]></title><link>https://blog.youkuaiyun.com/reliveyy/article/details/7902063</link><guid>https://blog.youkuaiyun.com/reliveyy/article/details/7902063</guid><author>reliveyy</author><pubDate>Fri, 24 Aug 2012 00:50:03 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;
int n,v[60],m[60],sum,dp[250010];
int main()
{
    while(cin >> n)
    {
        if(n<0)break;
        sum = 0;
        for(int i=0;i<n;i++)
        {]]></description><category></category></item><item><title><![CDATA[HDU 1153 Magic Bitstrings （找规律）]]></title><link>https://blog.youkuaiyun.com/reliveyy/article/details/7901490</link><guid>https://blog.youkuaiyun.com/reliveyy/article/details/7901490</guid><author>reliveyy</author><pubDate>Thu, 23 Aug 2012 21:25:44 +0800</pubDate><description><![CDATA[#include 

using namespace std;
long long p;
int a[100010];
int main()
{
    while(cin >> p)
    {
        if(p==0)break;
        if(p==2)cout << "Impossible" << endl;
        else
        {]]></description><category></category></item><item><title><![CDATA[HDU 1100 Trees Made to Order （Catalan数）]]></title><link>https://blog.youkuaiyun.com/reliveyy/article/details/7901174</link><guid>https://blog.youkuaiyun.com/reliveyy/article/details/7901174</guid><author>reliveyy</author><pubDate>Thu, 23 Aug 2012 19:03:21 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;
int catalan[19]={    1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862,
                     16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 47763]]></description><category></category></item><item><title><![CDATA[HDU 1085 Holding Bin-Laden Captive!]]></title><link>https://blog.youkuaiyun.com/reliveyy/article/details/7899700</link><guid>https://blog.youkuaiyun.com/reliveyy/article/details/7899700</guid><author>reliveyy</author><pubDate>Thu, 23 Aug 2012 14:22:26 +0800</pubDate><description><![CDATA[#include 

using namespace std;
int num_1,num_2,num_5,c1[8010],c2[8010];
int main()
{
    while(cin >> num_1 >> num_2 >> num_5)
    {
        if(num_1==0&&num_2==0&&num_5==0)break;
        for(int i=0]]></description><category></category></item><item><title><![CDATA[HDU 1027 Ignatius and the Princess II]]></title><link>https://blog.youkuaiyun.com/reliveyy/article/details/7899633</link><guid>https://blog.youkuaiyun.com/reliveyy/article/details/7899633</guid><author>reliveyy</author><pubDate>Thu, 23 Aug 2012 13:59:06 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

int main()
{
    int m,n,a[1010];
    while(cin >> n >> m)
    {
        for(int i=0;i<n;i++)a[i]=i+1;
        for(int i=0;i<m-1;i++)next_permutation(a,a+n);]]></description><category></category></item></channel></rss>