<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ACM77的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ACM77</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ACM77]]></copyright><item><title><![CDATA[Shortest Prefixes]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/76169879</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/76169879</guid><author>ACM77</author><pubDate>Thu, 27 Jul 2017 09:47:11 +0800</pubDate><description><![CDATA[A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and "carbon". Note that the empty string is not cons]]></description><category></category></item><item><title><![CDATA[Repository]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/76169283</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/76169283</guid><author>ACM77</author><pubDate>Thu, 27 Jul 2017 09:33:23 +0800</pubDate><description><![CDATA[When you go shopping, you can search in repository for avalible merchandises by the computers and internet. First you give the search system a name about something, then the system responds with the r]]></description><category></category></item><item><title><![CDATA[Hat’s Words]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/76169176</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/76169176</guid><author>ACM77</author><pubDate>Thu, 27 Jul 2017 09:19:59 +0800</pubDate><description><![CDATA[A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. 
You are to find all the hat’s words in a dictionary. 


InputStandard input consis]]></description><category></category></item><item><title><![CDATA[What Are You Talking About]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/76168638</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/76168638</guid><author>ACM77</author><pubDate>Thu, 27 Jul 2017 09:13:39 +0800</pubDate><description><![CDATA[Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want ]]></description><category></category></item><item><title><![CDATA[poj2185Milking Grid（未完待续）]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75762176</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75762176</guid><author>ACM77</author><pubDate>Sat, 22 Jul 2017 16:54:21 +0800</pubDate><description><![CDATA[Milking Grid




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 8776
 
Accepted: 3820




Description

Every morning when they are milked, the Farmer John's cows for]]></description><category></category></item><item><title><![CDATA[po2406Power Strings]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75714140</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75714140</guid><author>ACM77</author><pubDate>Sat, 22 Jul 2017 11:02:02 +0800</pubDate><description><![CDATA[Power Strings




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 49274
 
Accepted: 20527




Description

Given two strings a and b we define a*b to be their concate]]></description><category></category></item><item><title><![CDATA[Count the string]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75669555</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75669555</guid><author>ACM77</author><pubDate>Fri, 21 Jul 2017 17:43:17 +0800</pubDate><description><![CDATA[It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example: 
s: "aba]]></description><category></category></item><item><title><![CDATA[Oulipo]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75669355</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75669355</guid><author>ACM77</author><pubDate>Fri, 21 Jul 2017 17:31:57 +0800</pubDate><description><![CDATA[he French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: 

Tout avait Pair normal, mais tout ]]></description><category></category></item><item><title><![CDATA[D - A + B for you again]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75667340</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75667340</guid><author>ACM77</author><pubDate>Fri, 21 Jul 2017 17:20:39 +0800</pubDate><description><![CDATA[Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of the addition between ]]></description><category></category></item><item><title><![CDATA[Clairewd’s message]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75666413</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75666413</guid><author>ACM77</author><pubDate>Fri, 21 Jul 2017 17:07:31 +0800</pubDate><description><![CDATA[Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sending it to ykwd. They had agreed that each letter of these mes]]></description><category></category></item><item><title><![CDATA[POJ 1703]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75449134</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75449134</guid><author>ACM77</author><pubDate>Wed, 19 Jul 2017 20:33:09 +0800</pubDate><description><![CDATA[Find them, Catch them




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 46068
 
Accepted: 14176




Description

The police office in Tadu City decides to say ends ]]></description><category></category></item><item><title><![CDATA[生动形象的描述并查集（转）]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75343396</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75343396</guid><author>ACM77</author><pubDate>Wed, 19 Jul 2017 10:38:52 +0800</pubDate><description><![CDATA[并查集是我暑假从高手那里学到的一招，觉得真是太精妙的设计了。以前我无法解决的一类问题竟然可以用如此简单高效的方法搞定。不分享出来真是对不起party了。（party：我靠，关我嘛事啊？我跟你很熟么？）

来看一个实例，HDU1232畅通工程


首先在地图上给你若干个城镇，这些城镇都可以看作点，然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整幅图的连通性问题。比如随意给你两个]]></description><category></category></item><item><title><![CDATA[并查集与带权并查集（转）]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75341223</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75341223</guid><author>ACM77</author><pubDate>Wed, 19 Jul 2017 10:36:13 +0800</pubDate><description><![CDATA[转自Chris_zzj的博客！




并查集

并查集是一个很高效算法，理解起来也很简单，写起来更简单。

①fat[i] = i;

②找到一个点的祖先





[cpp] view
 plain copy






int findfat(int x)  
{  
    if(fat[x] == x) return x;  
  ]]></description><category></category></item><item><title><![CDATA[Is It A Tree?]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75319441</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75319441</guid><author>ACM77</author><pubDate>Tue, 18 Jul 2017 19:05:04 +0800</pubDate><description><![CDATA[A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. 
There]]></description><category></category></item><item><title><![CDATA[棋盘问题 POJ - 1321]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75072022</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75072022</guid><author>ACM77</author><pubDate>Thu, 13 Jul 2017 15:54:35 +0800</pubDate><description><![CDATA[在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

Input
输入含有多组测试数据。 
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n 
当为-1 -1时表示输入结束]]></description><category></category></item><item><title><![CDATA[A - 迷宫问题 POJ - 3984]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/75071411</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/75071411</guid><author>ACM77</author><pubDate>Thu, 13 Jul 2017 15:48:18 +0800</pubDate><description><![CDATA[定义一个二维数组： 
int maze[5][5] = {

	0, 1, 0, 0, 0,

	0, 1, 0, 1, 0,

	0, 0, 0, 0, 0,

	0, 1, 1, 1, 0,

	0, 0, 0, 1, 0,

};

它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。

Input
一个5]]></description><category></category></item><item><title><![CDATA[二叉树排序查找]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/74455975</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/74455975</guid><author>ACM77</author><pubDate>Wed, 05 Jul 2017 16:58:54 +0800</pubDate><description><![CDATA[Elven Postman

Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)

Problem Description
Elves are very peculiar creatures. As we all know, they can live for a ve]]></description><category></category></item><item><title><![CDATA[满二叉树编号问题]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/74452046</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/74452046</guid><author>ACM77</author><pubDate>Wed, 05 Jul 2017 15:24:02 +0800</pubDate><description><![CDATA[S-Trees(满二叉树数组保存与编号)




A Strange Tree (S-tree) over the variable set Xn = {x1,x2,...,xn} is a binary tree representing a Boolean function f:{0,1}->{0,1}. Each path of the S-tree begins at the r]]></description><category></category></item><item><title><![CDATA[线性表的链式结构创建与实现（一）]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/74322319</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/74322319</guid><author>ACM77</author><pubDate>Tue, 04 Jul 2017 14:26:58 +0800</pubDate><description><![CDATA[个人理解，仅供参考
创建链表的步骤：
1：创建头指针
2：将头指针指向空，防止野指针
3：将新的指针移动到头指针（我习惯认为是将头指针赋值给它）
4：建立新结点
5：让新指正指向空，防止野指针
6：给新指针赋值
7：让尾指针指向当前指针，实现链表的连接（我习惯认为是让上一指针指向它）
8：将尾指针移向当前指针（我习惯认为将当前指针赋值给它）
***每次创建新指针的时候都要将指针]]></description><category></category></item><item><title><![CDATA[线性表的顺式储存结构与实现]]></title><link>https://blog.youkuaiyun.com/ACM77/article/details/74297735</link><guid>https://blog.youkuaiyun.com/ACM77/article/details/74297735</guid><author>ACM77</author><pubDate>Tue, 04 Jul 2017 11:17:15 +0800</pubDate><description><![CDATA[//数组的形式表示顺序表 
#include
using namespace std;

//建立非空的顺序表（长度为len，整型） 
void CreateSequence(int *sequence,int len)
{
	int value;
	for(int count=0;count<len;count++)    //count用来计数
	{
		cin>>value;        ]]></description><category></category></item></channel></rss>