<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[whh869的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/whh869</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; whh869]]></copyright><item><title><![CDATA[二维数组简单练习]]></title><link>https://blog.youkuaiyun.com/whh869/article/details/100637674</link><guid>https://blog.youkuaiyun.com/whh869/article/details/100637674</guid><author>whh869</author><pubDate>Sun, 08 Sep 2019 20:36:34 +0800</pubDate><description><![CDATA[-------------代码实现:--------------------
#include
#include
#include
#define N 64
using namespace std;
bool peak(int grid[N][N],int h,int l);
int main(void) {
int nrows,nclos;
int map[N][N];
string file...]]></description><category></category></item><item><title><![CDATA[代码战争 - 沙蛇]]></title><link>https://blog.youkuaiyun.com/whh869/article/details/97034743</link><guid>https://blog.youkuaiyun.com/whh869/article/details/97034743</guid><author>whh869</author><pubDate>Tue, 23 Jul 2019 21:03:33 +0800</pubDate><description><![CDATA[// 这片区域布满了火焰陷阱。幸好我们之前派出了侦察员，他沿路在地上留下了宝石作为暗号，我们只需要顺着最近的宝石走就能躲过这些陷阱。
// 沙漠峡谷似乎会干扰你使用眼镜的findNearest技能！
// 你需要自己找到离你最近的宝石。
while(true) {
var coins = hero.findItems();
var coinIndex = 0;
var nearest = null...]]></description><category></category></item></channel></rss>