<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Suda_cake的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Suda_cake</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Suda_cake]]></copyright><item><title><![CDATA[ZOJ1002 Fire Net]]></title><link>https://blog.youkuaiyun.com/Suda_cake/article/details/82821517</link><guid>https://blog.youkuaiyun.com/Suda_cake/article/details/82821517</guid><author>Suda_cake</author><pubDate>Sun, 23 Sep 2018 13:07:36 +0800</pubDate><description><![CDATA[题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1002


#include&amp;lt;stdio.h&amp;gt;

#define true 1
#define false 0

char map[4][4];
int vis[4][4];
int max,count;
int n;

int is_ok(int a,...]]></description><category></category></item><item><title><![CDATA[约瑟夫问题,“遍历”思想.(C语言实现)]]></title><link>https://blog.youkuaiyun.com/Suda_cake/article/details/78690999</link><guid>https://blog.youkuaiyun.com/Suda_cake/article/details/78690999</guid><author>Suda_cake</author><pubDate>Fri, 01 Dec 2017 21:57:47 +0800</pubDate><description><![CDATA[约瑟夫问题，“遍历”思想解决。(C实现)]]></description><category></category></item></channel></rss>