Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
求赐教#include <iostream> #include <stdio.h> #include <string.h> using namespace std; int map[105][105]; int dis[105]; bool vis[105]; int prim( int n) { } int main() { int n=0; int w=0; while(scanf("%d",&n)!=EOF)、//为虾米写成(while(scanf("%d",&n)!=EOF,n)就TLE { for( int i = 0; i<n; i++) for( int j = 0; j<n; j++) { scanf("%d",&w); map[i][j] = w; } printf("%d\n",prim(n)); } return 0; } Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator