2014年3月17日
C. Searching for Graph(cf)
摘要： C. Searching for Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's call an undirected graph ofnverticesp-interesting, if the following conditions fulfill:the graph contains exactly2n + pedges;the graph doesn't contain self-loops a 阅读全文
posted @ 2014-03-17 10:59 N_ll 阅读(419) 评论(0) 推荐(0)
B. Trees in a Row(cf)
摘要： B. Trees in a Rowtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Queen of England hasntrees growing in a row in her garden. At that, thei-th(1 ≤ i ≤ n)tree from the left has heightaimeters. Today the Queen decided to update the scenery of her 阅读全文
posted @ 2014-03-17 10:53 N_ll 阅读(389) 评论(0) 推荐(0)