https://blog.youkuaiyun.com/cBlithezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/cBlithe/article/details/81258233https://blog.youkuaiyun.com/cBlithe/article/details/81258233cBlitheSat, 28 Jul 2018 10:33:10 +0800https://blog.youkuaiyun.com/cBlithe/article/details/81257723https://blog.youkuaiyun.com/cBlithe/article/details/81257723cBlitheSat, 28 Jul 2018 09:57:23 +0800https://blog.youkuaiyun.com/cBlithe/article/details/80792176https://blog.youkuaiyun.com/cBlithe/article/details/80792176cBlitheSun, 24 Jun 2018 16:29:18 +0800https://blog.youkuaiyun.com/cBlithe/article/details/70213866https://blog.youkuaiyun.com/cBlithe/article/details/70213866cBlitheMon, 17 Apr 2017 17:25:44 +0800https://blog.youkuaiyun.com/cBlithe/article/details/68109828https://blog.youkuaiyun.com/cBlithe/article/details/68109828cBlitheWed, 29 Mar 2017 21:05:45 +0800https://blog.youkuaiyun.com/cBlithe/article/details/66492916https://blog.youkuaiyun.com/cBlithe/article/details/66492916cBlitheSun, 26 Mar 2017 21:44:22 +0800 #include int map[9][9]={ {1,1,1,1,1,1,1,1,1}, {1,0,0,1,0,0,1,0,1}, {1,0,0,1,1,0,0,0,1}, {1,0,1,0,1,1,0,1,1}, {1,0,0,0,0,1,0,0,1},]]>https://blog.youkuaiyun.com/cBlithe/article/details/66478095https://blog.youkuaiyun.com/cBlithe/article/details/66478095cBlitheSun, 26 Mar 2017 19:08:02 +0800https://blog.youkuaiyun.com/cBlithe/article/details/62440161https://blog.youkuaiyun.com/cBlithe/article/details/62440161cBlitheThu, 16 Mar 2017 20:33:29 +0800https://blog.youkuaiyun.com/cBlithe/article/details/62051689https://blog.youkuaiyun.com/cBlithe/article/details/62051689cBlitheTue, 14 Mar 2017 21:50:09 +0800 #include #include int main(void) { int *a, n; scanf("%d", &n); a = (int *)malloc(sizeof(int) * n); for (int i = 0; i < n; i++){ a[i]]>https://blog.youkuaiyun.com/cBlithe/article/details/60146695https://blog.youkuaiyun.com/cBlithe/article/details/60146695cBlitheFri, 03 Mar 2017 20:10:13 +0800 #include int main() { char]]>https://blog.youkuaiyun.com/cBlithe/article/details/55657447https://blog.youkuaiyun.com/cBlithe/article/details/55657447cBlitheSat, 18 Feb 2017 11:25:10 +0800 #include #include #include using namespace std; const int maxn=100; bool vst[maxn][maxn]; // 访问标记 int dir[4][2]={0,1,0,-1,1,0,-1,0}; // 方]]>https://blog.youkuaiyun.com/cBlithe/article/details/55657219https://blog.youkuaiyun.com/cBlithe/article/details/55657219cBlitheSat, 18 Feb 2017 10:57:02 +0800