摘要： 在已有的边上做Prim#include#include#includeusing namespace std;#define infinity 1000000class Point2D{public: double x,y;};Point2D point[1001];double map[1001][1001];double dis[1001];bool flag[1001];int n,m;int main(){ memset(flag,false,sizeof(flag)); int c,i,j,k; double len; double minone; scanf("%d%d& 阅读全文

摘要： 一道递推#includeusing namespace std;__int64 Gcd(__int64 x,__int64 y){if(x==y)return x;if(x==1||y==1)return 1;__int64 r;if(x<y){r=x;x=y;y=r;}while(y!=0){r=x%y;x=y;y=r;}return x;}int main(){char mark[51][101];__int64 sum[51][101];__int64 finalsum;int i,j;int n,n1,m;int colnum;int spoint;int epoint;int 阅读全文