<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/smaracoon</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; smaracoon]]></copyright><item><title><![CDATA[POJ2083 ZOJ2423 Fractal]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45333713</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45333713</guid><author>smaracoon</author><pubDate>Tue, 28 Apr 2015 11:32:05 +0800</pubDate><description><![CDATA[//3_4_1:	Fractal 分形打印X POJ2083 ZOJ2423
#include 
#include 
#include 
using namespace std;
char map[730][730];
void print(int n,int x,int y)
{
	int i,m = 1;
	if(n == 1)
	{
		map[x][y] = 'X';
		return;
]]></description><category></category></item><item><title><![CDATA[POJ2013 ZOJ2172 UVA 3055Symmetric Order]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45315471</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45315471</guid><author>smaracoon</author><pubDate>Mon, 27 Apr 2015 20:45:38 +0800</pubDate><description><![CDATA[//3_3_1:	Symmetric Order 姓名重新排列输出 POJ2013 ZOJ2172 UVA 3055
#include 
#include 
#include 
using namespace std;
char str[16][30];
int main()
{
	int i,n,cnt = 1;
	while(scanf("%d",&n),n != 0)
	{
		for(i ]]></description><category></category></item><item><title><![CDATA[POJ1979 ZOJ2165 Red and Black]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45314755</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45314755</guid><author>smaracoon</author><pubDate>Mon, 27 Apr 2015 19:46:27 +0800</pubDate><description><![CDATA[//3_2_1:	Red and Black 到达黑色瓷砖数量 POJ1979 ZOJ2165
#include 
#include 
#include 
using namespace std;
int i,j,mx,my,sx,sy,cnt,dir[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
char enter,map[22][22];
void DFS(int]]></description><category></category></item><item><title><![CDATA[POJ1281 ZOJ1371 UVA2514 MANAGER]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45313001</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45313001</guid><author>smaracoon</author><pubDate>Mon, 27 Apr 2015 17:14:41 +0800</pubDate><description><![CDATA[//2_4_5:	MANAGER 进程管理的模拟 POJ1281 ZOJ1371 UVA2514
#include 
#include 
#include 
using namespace std;
const int maxn = 10000 + 10;
int spend[maxn],delet[maxn],queue[maxn];
void quick_sort_max(int st,int]]></description><category></category></item><item><title><![CDATA[POJ2864 UVA3470 Pascal Library]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45288113</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45288113</guid><author>smaracoon</author><pubDate>Sun, 26 Apr 2015 14:23:20 +0800</pubDate><description><![CDATA[//2_4_3:	Pascal Library 是否有人参加全部晚宴 POJ2864 UVA3470
#include 
#include 
#include 
using namespace std;
int main()
{
	int N,D,i,j,temp,flag,a[100 + 10];
	while(1)
	{
		scanf("%d%d",&N,&D);
		if(N == 0 |]]></description><category></category></item><item><title><![CDATA[POJ1207 UVA100 The 3n+1 problem]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45287921</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45287921</guid><author>smaracoon</author><pubDate>Sun, 26 Apr 2015 13:53:52 +0800</pubDate><description><![CDATA[//2_4_2:	The 3n+1 problem NP问题 POJ1207 UVA100
#include 
#include 
#include 
using namespace std;
int main()
{
	int a,b,i,j,min,max,ans,time;
	while(scanf("%d %d",&a,&b) != EOF)
	{
		if(a > b)
		{
			m]]></description><category></category></item><item><title><![CDATA[POJ2000 ZOJ2345 UVA3045 Gold Coins]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45287043</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45287043</guid><author>smaracoon</author><pubDate>Sun, 26 Apr 2015 11:38:09 +0800</pubDate><description><![CDATA[//2_4_1:	Gold Coins 国王赏赐金币问题 POJ2000 ZOJ2345 UVA3045
#include 
#include 
#include 
using namespace std;
int main()
{
	int i,N,sum,day;
	while(scanf("%d",&N), N != 0)
	{
		day = sum = 0;
		for(i = 1;;i]]></description><category></category></item><item><title><![CDATA[UVA11000 Bee]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45286699</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45286699</guid><author>smaracoon</author><pubDate>Sun, 26 Apr 2015 11:03:16 +0800</pubDate><description><![CDATA[//2_3_1:	Bee 非洲雌蜂和雄蜂繁殖问题 UVA11000
#include 
#include 
#include 
using namespace std;
int main()
{
	unsigned a,b,t;
	int N,i;
	while(scanf("%d",&N),N != -1)
	{
		a = 0;
		b = 1;
		for(i = 0;i < N;i ++)]]></description><category></category></item><item><title><![CDATA[POJ1316 ZOJ1180 UVA640 Self Numbers]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45279531</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45279531</guid><author>smaracoon</author><pubDate>Sun, 26 Apr 2015 00:22:36 +0800</pubDate><description><![CDATA[//2_2_1:	Self Numbers 10000以内的自数 POJ1316 ZOJ1180 UVA640
#include 
#include 
#include 
using namespace std;
const int N = 10000 + 100;
int sum(int n)
{
	if(n < 10)	return n;
	else		return (n % 10) + su]]></description><category></category></item><item><title><![CDATA[POJ1922 ZOJ2229 Ride to School]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45276843</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45276843</guid><author>smaracoon</author><pubDate>Sat, 25 Apr 2015 23:00:54 +0800</pubDate><description><![CDATA[//2_1_2:	Ride to School 骑自行车跟上同学 POJ1922 ZOJ2229
#include 
#include 
#include 
using namespace std;
const double limit = 100000000;
int main()
{
	int i,N,time,speed;
	double min,sum;
	while(scanf("%d"]]></description><category></category></item><item><title><![CDATA[POJ2017 ZOJ2176 UVA3059 Speed Limit]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45273253</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45273253</guid><author>smaracoon</author><pubDate>Sat, 25 Apr 2015 19:42:59 +0800</pubDate><description><![CDATA[//2_1_1:	Speed Limit 里程计算 POJ2017 ZOJ2176 UVA3059
#include 
#include 
#include 
using namespace std;
int main()	
{
	int i,n,sum,time,temp,speed;
	while(scanf("%d",&n), n != -1)
	{
		sum = time = 0;
		]]></description><category></category></item><item><title><![CDATA[POJ1019 ZOJ1410 Number Sequence]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45271003</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45271003</guid><author>smaracoon</author><pubDate>Sat, 25 Apr 2015 16:00:49 +0800</pubDate><description><![CDATA[//1_5_10:	Number Sequence 求连续数组成的数组串的某位数 POJ1019 ZOJ1410
#include 
#include 
#include 
#include 
using namespace std;
unsigned a[31270],s[31270];
void init()
{
	int i;
	a[1] = s[1] = 1;
	for(i = 2;i <]]></description><category></category></item><item><title><![CDATA[POJ1833 排列]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45269775</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45269775</guid><author>smaracoon</author><pubDate>Sat, 25 Apr 2015 13:51:33 +0800</pubDate><description><![CDATA[//1_5_9:	排列 求下k个排列组合 POJ1833
#include 
#include 
#include 
using namespace std;
int a[1030];
void quick_sort(int st,int ed)			//快排算法
{
	int i = st,j = ed,temp;
	if(st < ed)
	{
		temp = a[st];
		while(]]></description><category></category></item><item><title><![CDATA[POJ1338 Ugly Numbers]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45248743</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45248743</guid><author>smaracoon</author><pubDate>Fri, 24 Apr 2015 17:02:17 +0800</pubDate><description><![CDATA[//1_5_8:	Ugly Numbers 丑陋数 POJ1338
#include 
#include 
#include 
using namespace std;
int min(int a,int b,int c)
{
	int temp = a < b ? a : b;
	return temp < c ? temp : c;
}
int main()
{
	int i,l,m,n,cn]]></description><category></category></item><item><title><![CDATA[POJ2136 Vertical Histogram]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45227017</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45227017</guid><author>smaracoon</author><pubDate>Thu, 23 Apr 2015 21:00:59 +0800</pubDate><description><![CDATA[//1_5_7:	Vertical Histogram 统计字符个数并输出 POJ2136
#include 
#include 
#include 
using namespace std;
int main()
{
	int i,j,max,let[26] = {0};
	char str[80],letter;
	for(i = 0;i < 4;i ++)
	{
		gets(str);
	]]></description><category></category></item><item><title><![CDATA[POJ2242 ZOJ1090 The Circumference of the Circle]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45226627</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45226627</guid><author>smaracoon</author><pubDate>Thu, 23 Apr 2015 20:32:07 +0800</pubDate><description><![CDATA[//1_5_6:	The Circumference of the Circle 三点确定圆 POJ2242 ZOJ1090
#include 
#include 
#include 
#include 
using namespace std;
const double pi = 3.141592653589793;
int main()
{
	double x1,y1,x2,y2,x3,y3,]]></description><category></category></item><item><title><![CDATA[POJ3006 Dirchlet's Theorem on Arithmetic Progressions]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45224979</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45224979</guid><author>smaracoon</author><pubDate>Thu, 23 Apr 2015 18:05:16 +0800</pubDate><description><![CDATA[//1_5_5:	Dirchlet's Theorem on Arithmetic Progressions 写第i个素数 POJ3006
#include 
#include 
#include 
#include 
using namespace std;
int isprime(int n)
{
	int i;
	int sq = (int)sqrt((double)n) + 1;
	if(]]></description><category></category></item><item><title><![CDATA[POJ1581 ZOJ1764 A Contesting Decision]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45224215</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45224215</guid><author>smaracoon</author><pubDate>Thu, 23 Apr 2015 17:16:16 +0800</pubDate><description><![CDATA[//1_5_4:	A Contesting Decision 判定竞赛题目与罚时 POJ1581 ZOJ1764
#include 
#include 
#include 
using namespace std;
struct node
{
	char name[20];
	int cnt,pun;
}team[100];
int main()
{
	int n,i,j,num,time,max]]></description><category></category></item><item><title><![CDATA[POJ3094 ZOJ2812 Quicksum]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45223329</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45223329</guid><author>smaracoon</author><pubDate>Thu, 23 Apr 2015 16:22:02 +0800</pubDate><description><![CDATA[//1_5_3:	Quicksum 求字符串的校验 POJ3094 ZOJ2812
#include 
#include 
#include 
using namespace std;
int main()
{
	int i,sum;
	char str[260];
	while(gets(str),str[0] != '#')
	{
		i = sum = 0;
		while(str[i])
]]></description><category></category></item><item><title><![CDATA[POJ2196 ZOJ2405 Specialized Four_Digit Numbers]]></title><link>https://blog.youkuaiyun.com/smaracoon/article/details/45223003</link><guid>https://blog.youkuaiyun.com/smaracoon/article/details/45223003</guid><author>smaracoon</author><pubDate>Thu, 23 Apr 2015 16:05:55 +0800</pubDate><description><![CDATA[//1_5_2:	Specialized Four_Digit Numbers 10,12和16进制的数字和相等 POJ2196 ZOJ2405
#include 
#include 
#include 
using namespace std;
int main()
{
	int i,j,sum1,sum2,sum3;
	for(i = 2992;i < 10000;i ++)
	{
		sum]]></description><category></category></item></channel></rss>