hdu 1501 Zipper
2013-06-09 15:12
316 查看
题目链接:hdu1501
#include<stdio.h> #include<string.h> #include<iostream> using namespace std; char a[205],b[205],map[405]; int v[205][205],flag,len; void dfs(int i,int j,int num) { if(num == len) { flag = 1; return ; } if(flag || v[i][j]) return ; v[i][j] = 1; if(a[i] == map[num]) dfs(i + 1 , j , num + 1); if(b[j] == map[num]) dfs(i , j + 1 , num + 1); } int main() { //freopen("in.txt","r",stdin); int T,p = 1; scanf("%d",&T); while(T--) { scanf("%s%s%s",a,b,map); memset(v,0,sizeof(v)); len = strlen(map); flag = 0; printf("Data set %d: ",p ++); dfs(0,0,0); if(flag) printf("yes\n"); else printf("no\n"); } return 0; }
相关文章推荐
- HDU 1501 Zipper 动态规划经典
- HDU 1501 Zipper 动态规划经典
- hdu zipper 1501
- hdu 1501 Zipper 记忆化搜索
- HDU--杭电--1501--Zipper--深搜、DP都好
- HDU 1501 Zipper (DFS)
- HDU 1501 & POJ 2192 Zipper(dp记忆化搜索)
- HDU 1501 Zipper 【DFS+剪枝】
- HDU 1501 Zipper 字符串
- HDU 1501 Zipper 【DFS】
- hdu(1501) Zipper
- hdu 1501 Zipper(dfs或dp)
- HDU_1501_Zipper
- HDU 1501 Zipper DP -
- HDU-1501 (POJ-2192) Zipper (DFS||DP)
- HDU-1501 Zipper DFS+记忆化搜索
- HDU-1501 Zipper 简单DP
- hdu 1501 Zipper
- HDU 1501 Zipper(DFS)
- hdu 1501 || poj 2192 Zipper(搜索:DFS)