<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[南柯一梦]]></title><description><![CDATA[想好色一样好学]]></description><link>https://blog.youkuaiyun.com/EUSIA</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; EUSIA]]></copyright><item><title><![CDATA[C++文件的读取写入入门小例子]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77982198</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77982198</guid><author>EUSIA</author><pubDate>Thu, 14 Sep 2017 16:36:54 +0800</pubDate><description><![CDATA[#include <fstream>
#include <iostream>
#include <iomanip>
using namespace std;int main()
{
    int i;
    cout<<"选择功能:\n1:write\n2.read\n";
    cin>>i;
    switch(i)
    {
    case 1:
        {]]></description><category></category></item><item><title><![CDATA[【转】素数判断四方法]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77982080</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77982080</guid><author>EUSIA</author><pubDate>Thu, 14 Sep 2017 16:30:30 +0800</pubDate><description><![CDATA[方法一：愚蠢型int i,n;
while(cin>>n)
{
    for(i=2;i;i++)
    {
     if(n%i==0)
     {
        break;
     }
   }
   if(i==n) cout<<"YES"<<endl; 
   else cout<<"NO"<<endl;
}
方法二：聪明了点int i,n;
while(cin>>n)
{]]></description><category></category></item><item><title><![CDATA[利用time.h获取本地时间]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77981966</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77981966</guid><author>EUSIA</author><pubDate>Thu, 14 Sep 2017 16:24:42 +0800</pubDate><description><![CDATA[教材问题
        //定义，time_t为long 型
        time_t ltime;
        //函数原型time_t time(time_t *timer),取得系统当前时间，形参保存结果  
        time(&ltime);
        /*
        将time_t时间转化为tm时间，而且按本地时间调整
        struct tm* l]]></description><category></category></item><item><title><![CDATA[最大公约数，最小公倍数]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77981855</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77981855</guid><author>EUSIA</author><pubDate>Thu, 14 Sep 2017 16:18:55 +0800</pubDate><description><![CDATA[入门问题，辗转相除法，但每次要用都记不起来了。int gcd(int m,int n)//最大公约数 
{
    int r,t;
    if(m<n)//确保m比较大 
    {
        t=m;
        m=n;
        n=t;
    }
    while(n!=0)//辗转相除法 
    {
        r=m%n;
        m=n;]]></description><category></category></item><item><title><![CDATA[【转】学习路线４]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77905950</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77905950</guid><author>EUSIA</author><pubDate>Sat, 09 Sep 2017 09:52:42 +0800</pubDate><description><![CDATA[原文链接 
1. 数据结构a) 单调队列b) 堆c) 并查集d) 树状数组e) 哈希表f) 线段树g) 字典树2. 图论a) 强连通分量b) 双连通分量（求割点，桥）c) 强连通分量与双连通分量缩点d) LCA、LCA与RMQ的转化e) 二分图匹配i. 二分图最大匹配ii. 最小点集覆盖iii. 最小路径覆盖iv. 二分图最优匹配v. 二分图多重匹配f) 网络流i. 最大流的基本SAPii. 最大流]]></description><category></category></item><item><title><![CDATA[【转】学习路线３]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77905932</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77905932</guid><author>EUSIA</author><pubDate>Sat, 09 Sep 2017 09:49:54 +0800</pubDate><description><![CDATA[原文链接1. 掌握C++语法，并熟练使用STL2. 试着实现STL的一些基本容器和函数，使自己基本能看懂STL源码3. 图论a) 使用优先队列优化Dijkstra和Primb) 单源最短路径之SPFAc) 差分约束系统d) 多源多点最短路径之FloydWarshall算法e) 求欧拉路(圈套圈算法）4. 进行复杂模拟题训练5. 拓扑排序6. 动态规划进阶a) 完全背包、多重背包等各种背包问题（参见背]]></description><category></category></item><item><title><![CDATA[【转】学习路线２]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77905916</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77905916</guid><author>EUSIA</author><pubDate>Sat, 09 Sep 2017 09:47:17 +0800</pubDate><description><![CDATA[原文链接 
1. 掌握C++部分语法，如引用类型，函数重载等，基本明白什么是类。2. 学会BFS与DFSa) 迷宫求解（最少步数）b) 水池数目(NYOJ27)c) 图像有用区域(NYOJ92)d) 树的前序中序后序遍历3. 动态规划（15题以上），要学会使用循环的方法写动态规划，同时也要学会使用记忆化搜索的方法。a) 最大子串和b) 最长公共子序列c) 最长单调递增子序列(O(n)与O(n log]]></description><category></category></item><item><title><![CDATA[【转】学习路线１]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77905875</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77905875</guid><author>EUSIA</author><pubDate>Sat, 09 Sep 2017 09:43:16 +0800</pubDate><description><![CDATA[原文链接 
1. C语言基础语法必须全部学会a) 推荐“语言入门”分类20道题以上b) 提前完成C语言课程设计2. 简单数学题（推荐“数学”分类20道以上）需要掌握以下基本算法：a) 欧几里德算法求最大公约数b) 筛法求素数c) 康托展开d) 逆康托展开e) 同余定理f) 次方求模3. 计算几何初步a) 三角形面积4. 学会简单计算程序的时间复杂度与空间复杂度5. 二分查找法6. 简单的排序算法a)]]></description><category></category></item><item><title><![CDATA[Hdu:2020 绝对值排序]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/77841770</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/77841770</guid><author>EUSIA</author><pubDate>Mon, 04 Sep 2017 20:53:04 +0800</pubDate><description><![CDATA[#include <iostream>
#include <algorithm>
using namespace std;int input[105];
int ab[105];
int temp[105];
int index[105];int cmp(int a,int b)
{
    return (a>b);
}int main()
{
    int n;
    while(cin>>]]></description><category></category></item><item><title><![CDATA[关于int8_t,uint8_t.....等数据类型的问题]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/76401235</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/76401235</guid><author>EUSIA</author><pubDate>Sun, 30 Jul 2017 19:06:19 +0800</pubDate><description><![CDATA[最近在看代码的时候，发现好多师兄写的代码喜欢用下面一些数据类型:typedef uint8_t     u8_t;
typedef int8_t      i8_t;
typedef uint16_t    u16_t;
typedef int16_t     i16_t;
typedef uint32_t    u32_t;
typedef int32_t     i32_t;
typedef u]]></description><category></category></item><item><title><![CDATA[关于ubuntu16.04下无线驱动的问题]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/76349798</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/76349798</guid><author>EUSIA</author><pubDate>Sat, 29 Jul 2017 19:01:48 +0800</pubDate><description><![CDATA[最近由于学习ROS开始使用ubuntu系统，一开始安装的虚拟机，后来感觉不方便，就安装了win10+ubuntu16.04双系统 
至于系统如何安装，网上教程很多，这里就不重复。 
安装完系统后很蛋疼的一个问题是我的ubuntu系统连接不上无线网，不是连接不上，是搜不到。 
后来搜索网上教程，是无线驱动没有安装好，于是我就安装无线驱动。 
怎么安装无线驱动呢，网上也有很多，我是在windows下写的]]></description><category></category></item><item><title><![CDATA[浮点数的比较]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/57080309</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/57080309</guid><author>EUSIA</author><pubDate>Sat, 25 Feb 2017 14:28:46 +0800</pubDate><description><![CDATA[const double eps =1e-8;
#define Equ(a,b) (fabs((a)-(b))<(eps))
#define More(a,b) ((a)-(b)>(eps))
#define Less(a,b) ((a)-(b)<(-eps))]]></description><category></category></item><item><title><![CDATA[算法之路四：codeforces 71A]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54983488</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54983488</guid><author>EUSIA</author><pubDate>Sat, 11 Feb 2017 15:03:24 +0800</pubDate><description><![CDATA[#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;const int maxn=105;
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        char word[maxn];
        scanf("%s",word);]]></description><category></category></item><item><title><![CDATA[算法之路二：刘汝佳算法竞赛入门经典：链表 悲剧文本UVa11988]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54950270</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54950270</guid><author>EUSIA</author><pubDate>Thu, 09 Feb 2017 17:54:43 +0800</pubDate><description><![CDATA[#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=100005;
int last,cur,next[maxn];
char s[maxn];int main()
{
    while(scanf("%s",s+1)==1)
    {
        int n=strlen(s+1);]]></description><category></category></item><item><title><![CDATA[算法之路二：刘汝佳算法竞赛入门经典：栈和队列 矩阵链乘UVA442]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54949780</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54949780</guid><author>EUSIA</author><pubDate>Thu, 09 Feb 2017 17:42:58 +0800</pubDate><description><![CDATA[#include<cstdio>
#include<stack>
#include<iostream>
#include<cstring>
using namespace std;struct Matrix{
    int a,b;
    Matrix(int a=0,int b=0):a(a),b(b) {}
}m[26];stack<Matrix>s;int main()
{
    int]]></description><category></category></item><item><title><![CDATA[算法之路二：刘汝佳算法竞赛入门经典：栈和队列 铁轨UVa514]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54949490</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54949490</guid><author>EUSIA</author><pubDate>Thu, 09 Feb 2017 17:26:29 +0800</pubDate><description><![CDATA[#include<cstdio>
#include<stack>
using namespace std;
const int maxn=1010;int n,target[maxn];int main()
{
    while(scanf("%d",&n)==1)
    {
        stack<int>s;
        int A=1,B=1;
        for(int i=]]></description><category></category></item><item><title><![CDATA[算法之路四：codeforces 4A]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54766688</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54766688</guid><author>EUSIA</author><pubDate>Sat, 28 Jan 2017 11:14:27 +0800</pubDate><description><![CDATA[#include<cstdio>
#include<iostream>using namespace std;int main()
{
    long long n,m,a;
    cin>>n>>m>>a;
    long long  k,t;
    if(n%a==0) k=n/a;
    else k=n/a+1;
    if(m%a==0) t=m/a;
    else t=m]]></description><category></category></item><item><title><![CDATA[算法之路四：codeforces 1A]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54766674</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54766674</guid><author>EUSIA</author><pubDate>Sat, 28 Jan 2017 11:05:44 +0800</pubDate><description><![CDATA[#include<cstdio>
#include<iostream>using namespace std;int main()
{
    long long n,m,a;
    cin>>n>>m>>a;
    long long  k,t;
    if(n%a==0) k=n/a;
    else k=n/a+1;
    if(m%a==0) t=m/a;
    else t=m]]></description><category></category></item><item><title><![CDATA[算法之路二：刘汝佳算法竞赛入门经典：STL队列 团体队列UVA540]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54744334</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54744334</guid><author>EUSIA</author><pubDate>Thu, 26 Jan 2017 15:58:22 +0800</pubDate><description><![CDATA[#include<cstdio>
#include<queue>
#include<map>using namespace std;const int maxt=1000+10;int main()
{
    int t,kase=0;
    while(scanf("%d",&t)==1&&t)
    {
        printf("Scenario #%d\n",++kase);]]></description><category></category></item><item><title><![CDATA[算法之路二：刘汝佳算法竞赛入门经典：STL映射 反片语UVA156]]></title><link>https://blog.youkuaiyun.com/EUSIA/article/details/54744182</link><guid>https://blog.youkuaiyun.com/EUSIA/article/details/54744182</guid><author>EUSIA</author><pubDate>Thu, 26 Jan 2017 15:05:34 +0800</pubDate><description><![CDATA[#include<iostream>
#include<string>
#include<cctype>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;map<string,int> cnt;
vector<string> words;string repr(const string&s)//将单词进行标]]></description><category></category></item></channel></rss>