DieOrThink

#include#include#include#include#includeusing namespace std;int n,m;#define N 1002#define inf 0x7f7f7f7fchar maze[N][N];int m_f[N][N];bool vis[N][N];int dx[4]={0,0,-1,1};int dy[4]={-1,1,0

#include#include#include#includeusing namespace std;#define N 100001int n;bool vis[N];struct node{ int v; node *next;};struct headnode{ node *head;}vertex[N];struct typenode{ int x,le

#include#include#include#include#includeusing namespace std;#define N 30char Map[N][N];int n,m;int dx[4]={-1,0,1,0};int dy[4]={0,1,0,-1};struct node{ int x,y; int steps; int dir; int c

#include#include#includeusing namespace std;char str[20];#define N 32100int temp1[N],temp2[N];int cnt1,cnt2;void dfs1(int pos,int l,int cnt,int pre){ if(pos==l) { if(!cnt)

#include#include#include#include#include#include#include#includeusing namespace std;#define inf 0x7f7f7f7f#define N 1010mapma;vectorg[N];int dis[N][N];queue p;bool vis[N];void bfs(int

#include#include#include#include#include#define inf 0x7f7f7f7fusing namespace std;#define N 60struct node{ int x,y; int steps;}s[N];int val[N];int minn;int edge[N][N][N];//核心1bool vis[N

#include#includeusing namespace std;#define PI 2*asin(1.0)int main(){ double len,n,c; while(scanf("%lf%lf%lf",&len,&n,&c)!=EOF) { if(len==-1&&n==-1&&c==-1) break; dou