<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ibigprogramer的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Ibigprogramer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ibigprogramer]]></copyright><item><title><![CDATA[CF 319/B Psychos in a Line]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/49766813</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/49766813</guid><author>Ibigprogramer</author><pubDate>Tue, 10 Nov 2015 23:20:32 +0800</pubDate><description><![CDATA[原题链接：点击打开链接
题目大意：一个n个数的队列，每个数的大小从1-n随机分配。定义这样一种规则：如果一个数比它右边得数大，那么他可以吃掉这个数，同理，它也可以被左边的数吃掉，吃和被吃可以同时发生，算作一步。问：到最后稳定状态过去几步。
思路：记录一个step数组，记录每个数被吃掉要花的步数，只需要找到最近的大于该数的数就可以了。#include
#include
#define maxn ]]></description><category></category></item><item><title><![CDATA[hdu 2096 小明A+B 刷题]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47830035</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47830035</guid><author>Ibigprogramer</author><pubDate>Fri, 21 Aug 2015 09:56:56 +0800</pubDate><description><![CDATA[小明A+B
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 30830    Accepted Submission(s): 14727



Problem Description

小明今年3岁了, 现在他已经能够认识]]></description><category></category></item><item><title><![CDATA[poj3090Visible Lattice Points]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47706701</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47706701</guid><author>Ibigprogramer</author><pubDate>Sun, 16 Aug 2015 21:29:10 +0800</pubDate><description><![CDATA[原题链接：http://poj.org/problem?id=3090
题目大意：行数与列数互质，星星就可见。矩阵对称，只需检查一半。
第一次未做特殊处理，复杂度是1000*1000*1000，TLE。
#include
#include

int GCD(int a,int b)
{
	if(b == 0)
		return a;
	else
		return GCD(b,a%b);
}]]></description><category></category></item><item><title><![CDATA[poj2492 + 并查集]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47681949</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47681949</guid><author>Ibigprogramer</author><pubDate>Sat, 15 Aug 2015 15:29:28 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=2492
题目大意：每组测试数据给出n个虫子和m种交配组合，判断虫子中有没有同性交配的。
解决方案：首先大方向确定用并查集，每个虫子都初始化为一个集合。输入交配组合是，对每队虫子先判断他们是否在一个集合，如不在，则合并集合，若在，判断他们是否同性。判断方法为与祖先进行比较。
虽然思路很清楚，但要实现的好也不容易，花了一些时间去看别]]></description><category></category></item><item><title><![CDATA[HDU1285确定比赛名次 + 拓扑排序]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47206845</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47206845</guid><author>Ibigprogramer</author><pubDate>Sun, 02 Aug 2015 13:54:26 +0800</pubDate><description><![CDATA[原题连接：http://acm.hdu.edu.cn/showproblem.php?pid=1285
#include
#include
#define Max 510
typedef struct vert
{
	int num;           //结点编号
	struct vert* next;
}G_v;
typedef struct node
{
	int InDgree,Out]]></description><category></category></item><item><title><![CDATA[poj2367Genealogical tre]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47205923</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/47205923</guid><author>Ibigprogramer</author><pubDate>Sun, 02 Aug 2015 11:58:01 +0800</pubDate><description><![CDATA[原题连接：http://poj.org/problem?id=2367
思路：拓扑排序
#include
#include
typedef struct vert
{
	int num;           //结点编号
	struct vert* next;
}G_v;
typedef struct node
{
	int InDgree,OutDgree;            //出度和]]></description><category></category></item><item><title><![CDATA[HDU1061Rightmost Digit题解]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46958809</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46958809</guid><author>Ibigprogramer</author><pubDate>Sun, 19 Jul 2015 22:00:19 +0800</pubDate><description><![CDATA[Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 39128    Accepted Submission(s): 14753



Problem Description

Given a ]]></description><category></category></item><item><title><![CDATA[左偏树]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46823751</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46823751</guid><author>Ibigprogramer</author><pubDate>Fri, 10 Jul 2015 00:19:48 +0800</pubDate><description><![CDATA[#include
#include
typedef struct node
{
	int key,dist;
	struct node *Left,*Right;
}LeftistTree;
void Swap(LeftistTree** a,LeftistTree** b)
{
	LeftistTree *tmp;
	tmp = *a;
	*a = *b;
	*b = tmp;
}
Leftis]]></description><category></category></item><item><title><![CDATA[二叉堆]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46822627</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46822627</guid><author>Ibigprogramer</author><pubDate>Thu, 09 Jul 2015 22:25:05 +0800</pubDate><description><![CDATA[#include
#include

int lowbit(int x)
{
	int z;
	z = ~x;
	z++;
	return (x & z);
}
//测试
/*int main(void)
{
	int n,t;
	n = 50;
	while(n)
	{
		t = lowbit(n);
		printf("%d\n",t);
		n -= t;
	}	
	return 0;
}]]></description><category></category></item><item><title><![CDATA[poj3253Fence Repair 解题题解]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46822587</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46822587</guid><author>Ibigprogramer</author><pubDate>Thu, 09 Jul 2015 22:22:01 +0800</pubDate><description><![CDATA[Fence Repair




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 30807
 
Accepted: 9947




Description

Farmer John wants to repair a small length of the fence aroun]]></description><category></category></item><item><title><![CDATA[HDU 2032 杨辉三角]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46763835</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46763835</guid><author>Ibigprogramer</author><pubDate>Sun, 05 Jul 2015 16:26:36 +0800</pubDate><description><![CDATA[杨辉三角


Problem Description

还记得中学时候学过的杨辉三角吗？具体的定义这里不再描述，你可以参考以下的图形：
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1


 


Input

输入数据包含多个测试实例，每个测试实例的输入只包含一个正整数n（1

 


Output

对应]]></description><category></category></item><item><title><![CDATA[HDU 2028 Lowest Common Multiple Plus]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46763065</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46763065</guid><author>Ibigprogramer</author><pubDate>Sun, 05 Jul 2015 14:34:20 +0800</pubDate><description><![CDATA[Lowest Common Multiple Plus



Problem Description

求n个数的最小公倍数。

 


Input

输入包含多个测试实例，每个测试实例的开始是一个正整数n，然后是n个正整数。

 


Output

为每组测试数据输出它们的最小公倍数，每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。
]]></description><category></category></item><item><title><![CDATA[C语言 非打印字符]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46757781</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46757781</guid><author>Ibigprogramer</author><pubDate>Sat, 04 Jul 2015 21:29:07 +0800</pubDate><description><![CDATA[#include

int main(void)
{
	char ch;
	ch = 7;
	int count = 20;
	/*printf("%c",ch);
	printf("\007");		
	printf("\a");
	printf("\7");
	printf("\x7");
	printf("%c",'\7');*/
	printf("Hello\073\n");
	print]]></description><category></category></item><item><title><![CDATA[整数溢出]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46745113</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46745113</guid><author>Ibigprogramer</author><pubDate>Fri, 03 Jul 2015 19:47:51 +0800</pubDate><description><![CDATA[#include

int main(void)
{
	int i,a = 1;
	long int b = 1;
	unsigned int c = 1; 
	short d = 1;
	for(i = 1;i <= 31;i ++)
	{
		a *= 2;
	}
	a = a - 1;
	printf("a = %d\n",a);
	a += 1;
	printf("a = %d\n",a)]]></description><category></category></item><item><title><![CDATA[简单的学籍管理系统]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46715245</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46715245</guid><author>Ibigprogramer</author><pubDate>Wed, 01 Jul 2015 21:39:38 +0800</pubDate><description><![CDATA[#include
#include
typedef struct student
{
	int num;                      //学号
	char name[20];                //姓名
	float Chinese;                //语数外成绩
	float Math;
	float English;
	float Average;]]></description><category></category></item><item><title><![CDATA[设有两个集合A和集合B，要求设计生成集合C=A∩B的算法，其中集合A、B和C用链式存储结构表示]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46700555</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46700555</guid><author>Ibigprogramer</author><pubDate>Tue, 30 Jun 2015 21:17:57 +0800</pubDate><description><![CDATA[#include
#include
typedef int ElemType;
typedef struct Lnode
{
	ElemType date;
	struct Lnode* next;
}*LNode;

LNode InitLnode(void)                 //初始化链表
{
	LNode L;
	L = (LNode)malloc(sizeof(struct]]></description><category></category></item><item><title><![CDATA[设计在单链表中删除值相同的多余结点的算法]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46699915</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46699915</guid><author>Ibigprogramer</author><pubDate>Tue, 30 Jun 2015 20:24:09 +0800</pubDate><description><![CDATA[#include
#include
typedef int ElemType;
typedef struct Lnode
{
	ElemType date;
	struct Lnode* next;
}*LNode;

LNode InitLnode(void)                 //初始化链表
{
	LNode L;
	L = (LNode)malloc(sizeof(struct]]></description><category></category></item><item><title><![CDATA[查找二叉树的操作]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46675985</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46675985</guid><author>Ibigprogramer</author><pubDate>Mon, 29 Jun 2015 00:10:25 +0800</pubDate><description><![CDATA[#include
#include
typedef int Elemtype;
typedef struct TreeNode *SearchTree;
typedef struct TreeNode *position;
struct TreeNode
{
	Elemtype Element;
	SearchTree Left;
	SearchTree Right;
};

/*建立一颗空树*/]]></description><category></category></item><item><title><![CDATA[堆栈判断文本括弧是否对称]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46671981</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46671981</guid><author>Ibigprogramer</author><pubDate>Sun, 28 Jun 2015 15:53:44 +0800</pubDate><description><![CDATA[#include
#include
#include

#define Maxsize 10
typedef  char elemtype;
struct Node;
typedef struct Node *PtrToNode;
typedef PtrToNode Stack;

typedef struct Node
{
	elemtype ch;
	Stack next;
}Node;

S]]></description><category></category></item><item><title><![CDATA[浅析手机充电时不断重启]]></title><link>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46546557</link><guid>https://blog.youkuaiyun.com/Ibigprogramer/article/details/46546557</guid><author>Ibigprogramer</author><pubDate>Thu, 18 Jun 2015 12:26:49 +0800</pubDate><description><![CDATA[我这里说的不断重启与主板问题的无限重启不是一个概念！


手机不断重启，以前只是听说，现在遇见过两回。姑且叫不断重启吧，因为我实在是没有耐心让继续下去，就果断地处理了。
我手机两次不断重启，都是在手机电池没电关机，插上充电器给手机充电的时候开始的，在果断地更换手机电池后结束的。

是什么原因导致手机不断重启呢？我们来分析一下：

1. 现象
手机启动，出现第一屏画面，然后黑屏，继]]></description><category></category></item></channel></rss>