ME4546的专栏

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1258<br />#include<iostream> using namespace std; #define N 15 int a[N],ans[N]; int num[101],real[N]; bool flag; int m,sum; void dfs(int x,int index,int s) { if(s==sum) { flag=1;

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1426<br />#include<iostream> using namespace std; #define N 11 char map[N][N]; int n; bool flag; struct node { int x,y; }p[85]; void out() { for(int i=0;i<9;i++) { printf("%c",map[i][0]);

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1307<br />题目半天看懂<br />#include<iostream> #include<cstdio> #include<cmath> #include<cstring> using namespace std; #define N 11 struct node { int index[N]; }map[N*N*N][2]; int dir[4][2]={-1,0,0,-1,1,

http://acm.hdu.edu.cn/showproblem.php?pid=1455#include#includeusing namespace std;#define N 64int len[N];bool h[N];int n,s,l;int Count;bool flag;bool cmp(int x,int y){ return x

http://acm.hdu.edu.cn/showproblem.php?pid=2553#includeusing namespace std;#define N 10int n;int ans;bool mark[N][N];bool judge(int h,int x){ int hh=h-1; int ll=x-1; while(hh>=0&&

<br />http://acm.hdu.edu.cn/diy/contest_showproblem.php?pid=1007&cid=10579&hide=1&problem=Problem%20%20G<br />#include<iostream> using namespace std; #define N 12 int map[N][N]; struct node { int x,y; }p[N+4]; //存未知点 int n,m; int cn; int c; in