2015年8月12日

UVALive 5099

摘要： B - Nubulsa Expo Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Practice UVALive 5099 B - Nubulsa Expo Submit Status Pra 阅读全文

posted @ 2015-08-12 22:58 `Elaine 阅读(155) 评论(0) 推荐(0) 编辑

ZOJ-2753

摘要： Given an undirected graph, in which two vertexes can be connected by multiple edges, what is the min-cut of the graph? i.e. how many edges must be rem 阅读全文

posted @ 2015-08-12 22:56 `Elaine 阅读(145) 评论(0) 推荐(0) 编辑

导航