记忆化搜索
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
uva 10118 记忆化搜索
Little Bob is playing a game. He wants to win some candies in it - as many as possible.There are 4 piles, each pile contains N candies. Bob is given a basket which can hold at most 5candies. Each原创 2015-08-10 19:51:07 · 873 阅读 · 0 评论 -
手机九宫格滑动解锁方法种数(389112种)
有妹子问手机滑动解锁多少种方案,于是写了个记忆化搜索得出答案,也是有趣。#include #include #include #include #include using namespace std;#define N 4int vis[N][N];bool check(int x1, int y1, int x2, int y2){ if(abs(x1 -原创 2015-10-13 23:22:23 · 4642 阅读 · 0 评论