View Code #include<stdio.h>#include<string.h>int prime[10000];int vis[10000];int ans;int a[10000];void init(){ int i,j; int n=12997; memset(vis,0,sizeof(vis)); for(i=2;i<=n;i++) for(j=i*2;j<=n;j+=i) vis[j]=1; ans=1; for(i=2;i<=n;i++) { if... Read More
水题，不解释View Code #include<stdio.h>#include<string.h>const int INF = 9999999;int n,r,map[250][250];char city[250][30];int num;int max(int a,int b){ return a>b?a:b;}int min(int a,int b){ return a<b?a:b;}int find(char s[]){ int i; for(i=0;i<num;i++) if(strcmp(city[i],s)==0) ... Read More