2015年11月25日
CF-Mr. Kitayuta's Colorful Graph
摘要： Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, 阅读全文
posted @ 2015-11-25 19:19 Miller_S 阅读(368) 评论(0) 推荐(0) 编辑