X-man

摘要： #include<stdio.h>#include<string.h>#include<math.h>bool visit[100000];int prime[100000];int n;int x;int init_pri(){ memset(visit,true,sizeof(visit)); int num=0; for(int i=2;i<=n;i++) { if(visit[i]==true) { num++; prime[num]=i; } for(int j... 阅读全文

摘要： #include<stdio.h>#include<string.h>#include<queue>using namespace std;struct node{ int x,y; int time; friend bool operator<(node a,node b) { if(a.time>b.time)return true;//越小越优先 return false; }}in,im;int f[4][2]= {{-1,0},{1,0},{0,-1},{0,1}};int n,m;int startx,starty,ans;... 阅读全文