2011年1月29日

POJ 2421 Constructing Roads Kruskal+并查集
摘要： http://poj.org/problem?id=2421无向图的最小生成树 Kruskal算法Constructing RoadsTime Limit:2000MSMemory Limit:65536KDescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if 阅读全文
posted @ 2011-01-29 18:41 yming0221 阅读(138) 评论(0) 推荐(0)
POJ 2407 Relatives 欧拉函数
摘要： http://poj.org/problem?id=2407RelativesTime Limit:1000MSMemory Limit:65536KTotal Submissions:6610Accepted:2992DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 阅读全文
posted @ 2011-01-29 14:32 yming0221 阅读(153) 评论(0) 推荐(0)

导航