![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
湖南多校第十一场(网络同步赛)
文章平均质量分 86
Nowara_Shinnosuke
这个作者很懒,什么都没留下…
展开
-
B(1940): Remove the tree
Description A famous university will build a subway, so the captain want to remove all the trees. They do have decided though we don't know why they must remove trees to build the subway. There are s原创 2017-07-03 13:22:45 · 424 阅读 · 0 评论 -
G(1945): 最简单的题目
Description 小明有一台笔记本电脑,一台台式机电脑,两台电脑的性能相同,现在小明手里有N个等待运行的程序,每个程序运行所需的时间分别为n1,n2,n3,n4……,一台电脑同一时刻只能运行一个程序,一个程序只需要运行一次。两台电脑同时开始运行,请问小明该如何分配程序在这两台电脑上运行,使得最后结束运行的电脑的运行时间最短。 Input 输入不超过30组数据,每组数据第一行原创 2017-07-03 14:24:15 · 809 阅读 · 0 评论 -
H(1946): A Rational Sequence
Description An infinite full binary tree labeled by positive rational numbers is defined by: The label of the root is 1/1.The left child of label p/q is p/(p+q).The right child of label p/q is (p+原创 2017-07-03 14:53:30 · 521 阅读 · 0 评论