摘要： #includeusing namespace std;const int maxx=105;const int INF=1000000; int map[maxx][maxx];bool used[maxx];int dis[maxx];int mapsize;void init(int c){ int x,y,quan; for(x=0;x<maxx;x++) { used[x]=0; } for(x=0;x<maxx;x++) { dis[x]=INF; } for(x=0;x<maxx;x++)... 阅读全文

摘要： Prime Ring ProblemTime Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 13 Accepted Submission(s) : 5Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, .. 阅读全文