dfs
shuangyueliao
这个作者很懒,什么都没留下…
展开
-
4 1 1 1 1
http://acm.hdu.edu.cn/showproblem.php?pid=1518#include#includeint ok,vis[30],a[30];int sum,n,m;void dfs(int count,int l,int now){ int i; if(count==3) { ok=1; return ; }原创 2015-01-27 22:12:18 · 783 阅读 · 0 评论 -
素数环精品
http://acm.nyist.net/JudgeOnline/problem.php?pid=488#include#includeint prime[45],vis[25],h[1000],t,sign;void judge(int x){ int i; if(x==t && prime[h[0]+h[t-1]]!=0) { sign=1;原创 2015-03-05 22:08:04 · 345 阅读 · 0 评论 -
The partial sum problem
http://acm.nyist.net/JudgeOnline/problem.php?pid=927#include#includeint vis[30],a[30],n,k,sum,ok;void dfs(int pos,int sum){ int i; if(sum>k) return; if(sum==k) { ok=1; p原创 2015-03-08 19:30:09 · 405 阅读 · 0 评论 -
部分和问题
http://acm.nyist.net/JudgeOnline/problem.php?pid=1058#include#includeint vis[30],a[30],n,k,sum,ok;void dfs(int pos,int sum){ int i; if(sum>k) return; if(sum==k) { ok=1;原创 2015-03-08 17:07:09 · 394 阅读 · 0 评论 -
Square
http://poj.org/problem?id=2362#include#includeusing namespace std;int a[30],vis[30],t,sum;bool comp(int x,int y){ return x>y;}bool dfs(int num,int cur,int sum1){ if(sum1==sum原创 2015-04-04 17:01:16 · 338 阅读 · 0 评论 -
dfsN皇后
http://acm.hdu.edu.cn/showproblem.php?pid=2553#include#include#includeint sum,x[15],y[15]={0},n;int place(int k){ int i; for(i=1;i { if(fabs(x[i]-x[k])==fabs(i-k)|| x[k]==x[i]) return0原创 2015-01-30 20:13:43 · 524 阅读 · 0 评论 -
Sticks
http://acm.hdu.edu.cn/showproblem.php?pid=1455#include#includeusing namespace std;int a[100],vis[100],n,sum,k,res;bool cmp(int x,int y){ return x>y;}bool dfs(int num,int cur,int原创 2015-04-05 15:10:01 · 451 阅读 · 0 评论 -
Zipper记忆化搜索
#include#includeusing namespace std;char a[210],b[210],c[410];int vis[210][210],k;void dfs(int x,int y,int z){ if(k==1) return; if(z==strlen(c)) { k=1; return; } if(v原创 2015-04-06 16:49:51 · 455 阅读 · 0 评论 -
Sum It Up
http://acm.hdu.edu.cn/showproblem.php?pid=1258#includeusing namespace std;int sum,a[1010],b[1010],f,n,k;void dfs(int x,int num,int cur){ if(x==sum) { f=1; cout for(int i=1;i原创 2015-04-06 20:01:23 · 338 阅读 · 0 评论 -
连连看
http://acm.hdu.edu.cn/showproblem.php?pid=1175#include#includeint map[1001][1001],visit[1001][1001],n,m,ok,x1,y1,x2,y2;void dfs(int x,int y,int num,int turn)//x,y分别代表所在的行、列,num代表转了多少次,turn原创 2015-01-31 16:04:35 · 287 阅读 · 0 评论 -
A Knight's Journey
http://poj.org/problem?id=2488#include#includeint p,q,vis[30][30];int x1[900],y1[900],ok;void dfs(int x,int y,int num){ int hy[]={-1,1,-2,2,-2,2,-1,1},hx[]={-2,-2,-1,-1,1,1,2,2},i,nx原创 2015-04-08 18:40:47 · 268 阅读 · 0 评论 -
坦克大战
http://acm.nyist.net/JudgeOnline/problem.php?pid=284#include#includechar map[310][310];int step[310][310],x1,y1,x2,y2,n,m;void dfs(int a,int b,int x,int y){ if(x return; if(map[原创 2015-02-11 22:39:22 · 370 阅读 · 0 评论 -
一笔画问题
http://acm.nyist.net/JudgeOnline/problem.php?pid=42#include#includeint a[1010],vis[1010],m[1010][1010],p,q;void dfs(int n){ int i; vis[n]=1; for(i=1;i if(m[n][i]==1 && vis[i]==0原创 2015-02-07 22:51:53 · 577 阅读 · 0 评论 -
Sticks
http://acm.nyist.net/JudgeOnline/problem.php?pid=293#include #include using std::sort;int stick[66], n, sum, len, ok, temp;bool vis[66];bool cmp(int a, int b){ return a > b;}bo原创 2015-02-14 00:25:26 · 445 阅读 · 0 评论 -
Counting Sheep
http://acm.hdu.edu.cn/showproblem.php?pid=2952Counting Sheep 24 4#.#..#.##.##.#.#3 5###.#..#..#.####include#includeint n,m;char b[110][110];void dfs(int x,int y){原创 2015-01-28 14:13:28 · 716 阅读 · 0 评论 -
变形课
http://acm.hdu.edu.cn/showproblem.php?pid=1181sosoonrivergoesthemgotmoonbeginbig0#include#includechar b[10000][2];int k,vis[10000],ok;void dfs(int z,char x,char y){原创 2015-01-28 20:24:17 · 431 阅读 · 0 评论 -
搜索dfs迷宫通关
http://acm.hdu.edu.cn/showproblem.php?pid=1312搜索dfsHdu1312#includeint map[30][30];int t,n,m;int sx[4]={0,0,-1,1};int sy[4]={-1,1,0,0};void dfs(int h,int l){ inti,hx,hy; t++; m原创 2015-01-30 20:13:40 · 595 阅读 · 0 评论 -
Oil Deposits*@*@*
http://acm.hdu.edu.cn/showproblem.php?pid=12411 1*3 5*@*@***@***@*@*1 8@@****@*5 5 ****@*@@*@*@**@@@@*@@@**@0 0#includechar c[110][110];int a,b;void dfs(int x原创 2015-01-30 20:17:45 · 307 阅读 · 0 评论 -
dfs现在给大家一个6*6的迷宫,1代…
现在给大家一个6*6的迷宫,1代表是墙壁,0代码时道路,现在的问题就是能否从START走到END。编程实现。 1 111111START00111010011000111100END1原创 2015-01-30 20:13:48 · 2202 阅读 · 0 评论 -
hdu 1016(一道经典的dfs)题意…
http://acm.hdu.edu.cn/showproblem.php?pid=1016#include#includeintprime[40]={0,1,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0},n;//素数打表,因为n最大是20,所以只要打到40int visited原创 2015-01-30 20:13:51 · 387 阅读 · 0 评论 -
S.X.
http://acm.hdu.edu.cn/showproblem.php?pid=10104 4 5S.X...X...XD....3 4 5S.X...X....D0 0 0#include#include#include#include#define MAX 105int G[MAX][MAX] ;int vis[M原创 2015-01-26 23:26:49 · 574 阅读 · 0 评论 -
吝啬的国度
http://acm.nyist.net/JudgeOnline/problem.php?pid=20#include #include int map[100005];void DFS(int start){ int pre = map[start]; if (pre != 0) { DFS(pre); map[pre] = start;原创 2015-02-04 16:32:48 · 405 阅读 · 0 评论 -
找出从自然数1、2、... 、n(0<n<10)中任取r(0<r<=n)个数的所有组合
http://acm.nyist.net/JudgeOnline/problem.php?pid=32#include#includeint visit[20],a[20],n,r,b[20];void dfs(int num){ int i; if(num==r) { for(i=0;i printf("%d",b[i]); putch原创 2015-02-07 16:50:53 · 5350 阅读 · 0 评论 -
zb的生日
http://acm.nyist.net/JudgeOnline/problem.php?pid=325#include#define abs(x) (x)>0?(x):-(x)int n,arr[22],sum,min,temp,t,num;void dfs(int pos){ int i; if((t=abs(sum-2*temp)) min=t;原创 2015-02-15 16:10:11 · 392 阅读 · 0 评论