2016年02月_phantompiupiupiu

转载 UVA 11624

#include#include#include#includeusing namespace std;typedef struct name{ int i,j,f; int time;}mazes;const int maxn=1005;int n,m;char maze[maxn][maxn];int vis[maxn][maxn];mazes st

2016-02-29 15:29:21 206

原创 FZU 2150 稍复杂的BFS的问题

#include#include#include#includeusing namespace std;typedef struct name{ int i,j; int time;}mazes;typedef struct pp{ int i,j;}qp;const int INF=99999;const int maxn=150;int ka

2016-02-28 18:01:53 232

原创 POJ 3414

#include#include#includeusing namespace std;const int maxn=1000;int found;int vis[maxn][maxn];int head,tail;int a,b,c;typedef struct name{ int a,b,c; char road[maxn]; int step;

2016-02-27 13:48:35 189

原创 POJ 3087

#include#include#includeusing namespace std;const int maxn=1000;char a[maxn],b[maxn],c[maxn];char x[maxn],y[maxn],z[maxn];int kase;int step;int main(){ int n,m; scanf("%d",&n);

2016-02-27 10:53:06 243

转载 POJ 3126 又是一个BFS的例子

#include#includeusing namespace std;typedef struct name{ int prime; int step;}num;const int maxn=10000;int a,b;int vis[maxn];num q[maxn];int head,tail;int judgesushu(int a){

2016-02-26 16:56:38 185

转载 POJ 3984 静态数组队列学习应用

#includetypedef struct name{ int x; int y; int pre;}node;int maze[5][5];int dx[4]={1,-1,0,0};int dy[4]={0,0,1,-1};int head=0,tail=1;node r[100];void print(int i){ if(r[i].

2016-02-24 21:32:40 208

转载 POJ 1426 字符串来处理大数求解该题

#include #include typedef long long ll;using namespace std;const int maxn = 200;string s[maxn];int m[maxn],p,q,n;bool vis[205];void bfs(){ p = q = 0; memset(vis,0,sizeof(vis)); s[q

2016-02-23 20:20:01 282

转载 POJ 1426 二叉树的解法

#include#include#include#include#includeusing namespace std;const int maxn=500;int found;void dfs(int n,unsigned __int64 p,int k){ if(k==19) return ; if(found==1)

2016-02-23 20:15:07 227

原创 POJ 3278

#include#include#includeusing namespace std;typedef struct name{ int x; int time;}nk;const int maxn=1e7;bool vis[maxn];nk temp,temp2,temp3,temp4;int main(){ int n,k; scanf

2016-02-21 14:38:14 179

转载 POJ 2251 BFS的应用

#include#include#include#include#define maxn 100using namespace std;typedef struct pq{ int x,y,z; int step;}SE;int vis[maxn][maxn][maxn];char a[maxn][maxn][maxn];int f;SE st;SE

2016-02-20 20:25:11 164

原创 hdu 1285

#include#include#define maxn 1000using namespace std;int degree[maxn];int vis[maxn][maxn];int jg[maxn];int n,m;int main(){ int a,b,p; while(scanf("%d%d",&n,&m)==2) { me

2016-02-18 21:48:51 181

转载 poj 1321 新手初入简单搜素

#include#include#includeusing namespace std;const int maxn=10;char board[maxn][maxn]; //记录棋盘状态int place[maxn]; //记录一列是否已经放过棋子int n,k;int cnt,num; //cnt 是放棋子的方案数，num是已放棋子数目v

2016-02-17 11:53:44 291

原创 hdu 2399

#include#define maxn 10000int main(){ double sum=0,j=0; int f=1,i=0; char a[maxn]; while(gets(a)!=NULL) { f=1;sum=0;j=0; for(i=0;a[i];i++) {

2016-02-16 15:15:30 253

原创 HDU 1062

#include#define maxn 10000int main(){ int n,r,s=0,t; char a[maxn]; scanf("%d",&n); getchar(); while(n--) { gets(a);s=0;

2016-02-15 21:37:33 195

Phantom