<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[你若盛开 清风自来]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/yzRefueling</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; yzRefueling]]></copyright><item><title><![CDATA[2017青岛赛区亚洲区域赛网络赛 The Dominator of Strings]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/78021196</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/78021196</guid><author>yzRefueling</author><pubDate>Mon, 18 Sep 2017 17:04:06 +0800</pubDate><description><![CDATA[Problem Description

Here you have a set of strings. A dominator is a string of the set dominating all strings else. The string S is dominated by T if S is a substring of T.




Input

The in]]></description><category></category></item><item><title><![CDATA[2017青岛赛区亚洲区域赛网络赛 1011题题解]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/78012135</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/78012135</guid><author>yzRefueling</author><pubDate>Sun, 17 Sep 2017 18:23:47 +0800</pubDate><description><![CDATA[Problem Description

A cubic number is the result of using a whole number in a multiplication three times. For example, 3×3×3=27 so 27 is a cubic number. The first few cubic numbers are 1,8,27,64 an]]></description><category></category></item><item><title><![CDATA[使用VS2010编写C#程序时总是提示正由另一进程使用，因此该进程无法访问此文件的解决办法]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/78001785</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/78001785</guid><author>yzRefueling</author><pubDate>Sat, 16 Sep 2017 10:32:39 +0800</pubDate><description><![CDATA[解决办法：
1.因为这种情况并不是每次都出现，所以。假设项目名是test1。 先把VS关掉，然后把test1-->bin-->debug-->test1.exe强制删除。那么下次打开的时候，就可以了。因为debug下的test1.exe 每次都会重新生成。





2. 选择 调试--->终止调试即可。







3.尽量少用或者不用hide()方法，并且运行时]]></description><category></category></item><item><title><![CDATA[Digital Roots  求一个数的数字根]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77920478</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77920478</guid><author>yzRefueling</author><pubDate>Sun, 10 Sep 2017 10:16:53 +0800</pubDate><description><![CDATA[The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two]]></description><category></category></item><item><title><![CDATA[HDU - 1180 BFS 诡异的楼梯]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77878308</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77878308</guid><author>yzRefueling</author><pubDate>Thu, 07 Sep 2017 10:41:58 +0800</pubDate><description><![CDATA[Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的，相反,他们每隔一分钟就变动一次方向. 
比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线,这时Ron(Harry最好的朋友)告诉Harry正好有一个魔法道具可以帮助他寻找这样的路线,而那个魔法道具]]></description><category></category></item><item><title><![CDATA[无平方因子数]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77795128</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77795128</guid><author>yzRefueling</author><pubDate>Sat, 02 Sep 2017 09:35:02 +0800</pubDate><description><![CDATA[题目:
给出正整数n和m，区间[n,m]内的“无平方因子”的数有多少个？整数p无平方因子当且仅当不存在k > 1,使得p是k * k的倍数。1 


#include 
#include 
#include 
#include 
#include 
using namespace std;
const int maxn=100005;   //求出根下m内的质数即可
int p[maxn]]]></description><category></category></item><item><title><![CDATA[C++ 两个高精度数相乘]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77778063</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77778063</guid><author>yzRefueling</author><pubDate>Fri, 01 Sep 2017 21:20:17 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
const int N=1000;
int main()
{
   string s1,s2;
   int a[N],b[N],sum[N];
   int l1,l2;
   cin>>s1>>s2;
   l1=s1.length();
   l2=s]]></description><category></category></item><item><title><![CDATA[C++ 高精度加法 高精度减法 高精度乘法1]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77777244</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77777244</guid><author>yzRefueling</author><pubDate>Fri, 01 Sep 2017 20:44:21 +0800</pubDate><description><![CDATA[转自：http://blog.sina.com.cn/s/blog_4fdb102b010087ng.html
前言:由于计算机运算是有模运算,数据范围的表示有一定限制,如整型int(C++中int 与long相同)表达范围是(-2^31~2^31-1),unsigned long(无符号整数)是(0~2^32-1),都约为几十亿.如果采用实数型,则能保存最大的double只能提供15~16位的]]></description><category></category></item><item><title><![CDATA[深度优先搜索DFS和广度优先搜索BFS的总结]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77749273</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77749273</guid><author>yzRefueling</author><pubDate>Thu, 31 Aug 2017 16:56:15 +0800</pubDate><description><![CDATA[图的遍历顺序有两种：深度优先搜索（DFS）和广度优先搜索（BFS）
深度优先算法思想DFS

深度优先搜索遍历类似于树的先序遍历。假定给定图G的初态是所有顶点均未被访问过，在G中任选一个顶点i作为遍历的初始点，则深度优先搜索递归调用包含以下操作：

（1）访问搜索到的未被访问的邻接点；

（2）将此顶点的visited数组元素值置1；

（3）搜索该顶点的未被访问的邻接点，若该邻]]></description><category></category></item><item><title><![CDATA[搜索 BFS  HDU - 1072 ]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77748163</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77748163</guid><author>yzRefueling</author><pubDate>Thu, 31 Aug 2017 16:02:59 +0800</pubDate><description><![CDATA[Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial]]></description><category></category></item><item><title><![CDATA[数据结构 树 哈夫曼树及编码  C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621665</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621665</guid><author>yzRefueling</author><pubDate>Tue, 29 Aug 2017 07:59:57 +0800</pubDate><description><![CDATA[//哈弗曼编码的算法
#include 
#include 
#include 
#define N 50//叶子结点的最大值
#define M 2*N-1  //所有结点的最大值
typedef struct
{
    int weight;
    int parent;
    int LChild;
    int RChild;
} HTNode,HuffmanTree[M+1];]]></description><category></category></item><item><title><![CDATA[数据结构 图  Dijkstra算法]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621672</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621672</guid><author>yzRefueling</author><pubDate>Tue, 29 Aug 2017 07:59:36 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
const int maxn = 1024;
const int INF = 0x7fffffff;
typedef pair P;  //到这个点的最短路长度  和这个点
int ans;
struct edge  //边的终点 和长度
{
    int]]></description><category></category></item><item><title><![CDATA[数据结构 图的遍历 C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621689</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621689</guid><author>yzRefueling</author><pubDate>Tue, 29 Aug 2017 07:58:47 +0800</pubDate><description><![CDATA[#include 
#include 
#define max_vertex_num 100 //最多顶点个数
typedef char VertexData;
typedef int AdjType ;
typedef int OtherInfo ;
typedef struct ArcNode
{
	int adj; //对于无权图 用1表示相邻 0表示不相邻 ；对于带权图，则为权值类型]]></description><category></category></item><item><title><![CDATA[数据结构 图的建立 C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621696</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621696</guid><author>yzRefueling</author><pubDate>Tue, 29 Aug 2017 07:57:52 +0800</pubDate><description><![CDATA[#include 
#include 
#define max_vertex_num 100 //最多顶点个数
typedef char VertexData;
typedef int AdjType ;
typedef int OtherInfo ;
typedef struct ArcNode
{
	AdjType adj; //对于无权图 用1表示相邻 0表示不相邻 ；对于带权图，则为权值类]]></description><category></category></item><item><title><![CDATA[数据结构 树 二叉树的建立及遍历  C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621645</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621645</guid><author>yzRefueling</author><pubDate>Sun, 27 Aug 2017 17:23:17 +0800</pubDate><description><![CDATA[//二叉树的建立以及先序、中序、后序遍历算法 以及统计二叉树的叶子结点数目算法
#include 
#include 
typedef char DataType;
typedef struct Node
{
	DataType data;
	struct Node *LChild;
	struct Node *RChild;
} BiTNode,*BiTree;   //定义二叉树

void ]]></description><category></category></item><item><title><![CDATA[数据结构 树  层次遍历二叉树 C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621613</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621613</guid><author>yzRefueling</author><pubDate>Sun, 27 Aug 2017 17:18:55 +0800</pubDate><description><![CDATA[//层次遍历二叉树并输出结点的算法
#include 
#include 
typedef struct NNode
{
	char data;
	struct NNode *LChild;
	struct NNode *RChild;
} BiTNode,*BiTree;   //定义二叉树结点和结点指针

typedef BiTree QueueElementType;
typedef str]]></description><category></category></item><item><title><![CDATA[数据结构 链表 合并两个有序的单链表 C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621524</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621524</guid><author>yzRefueling</author><pubDate>Sun, 27 Aug 2017 17:07:29 +0800</pubDate><description><![CDATA[#include 
#include 
typedef struct Node
{
    int data;
    struct Node * next;
} Node,* Linklist;  //定义链表的结点，链表头

void Initlist (Linklist *L)  //初始化链表
{
    *L=(Linklist)malloc(sizeof(Node));
    (*L]]></description><category></category></item><item><title><![CDATA[数据结构 链表 循环单链表的建立  C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621488</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621488</guid><author>yzRefueling</author><pubDate>Sun, 27 Aug 2017 17:02:33 +0800</pubDate><description><![CDATA[#include 
#include 
typedef struct Node
{
    int data;
    struct Node * next;
} Node,* Linklist;  //定义链表的结点，链表头

void Initlist (Linklist *CL)  //初始化链表
{
    *CL=(Linklist)malloc(sizeof(Node));
    (]]></description><category></category></item><item><title><![CDATA[数据结构 链表  单链表的建立 C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621470</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621470</guid><author>yzRefueling</author><pubDate>Sun, 27 Aug 2017 17:00:05 +0800</pubDate><description><![CDATA[#include 
#include 
typedef struct Node
{
    int data;
    struct Node * next;
} Node,* Linklist;  //定义链表的结点，链表头

void Initlist (Linklist *L)  //初始化链表
{
    *L=(Linklist)malloc(sizeof(Node));
    (*L]]></description><category></category></item><item><title><![CDATA[数据结构 链队列的建立及其函数  C语言版]]></title><link>https://blog.youkuaiyun.com/yzRefueling/article/details/77621439</link><guid>https://blog.youkuaiyun.com/yzRefueling/article/details/77621439</guid><author>yzRefueling</author><pubDate>Sun, 27 Aug 2017 16:56:19 +0800</pubDate><description><![CDATA[#include 
#include 
typedef int QueueElementType;
typedef struct Node
{
    QueueElementType data;
    struct Node  *next;
} LinkQueueNode;  //定义队列结点
typedef struct
{
    LinkQueueNode *front; //队列头结点]]></description><category></category></item></channel></rss>