![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforces and TopCoder
IceFire
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #214 (Div. 2)
A题:简单模拟n = int(input())arr = []for i in range(0,4): a = [int(x) for x in input().split()] arr.append(a) found = Falsefor a in arr: m1 = min(a[0],a[1]) m2 = min(a[2],a[3])原创 2013-12-12 09:46:08 · 435 阅读 · 0 评论 -
SRM 600 DIV2
250ptThe company Manao Inc. cares for its employees and tries to provide them with as much comfort as possible. One of the services Manao Inc. provides is transportation of employees from N原创 2013-12-16 17:05:08 · 874 阅读 · 0 评论 -
寻找n个数中k个数的最小公倍数
给定一个数组,其中含有n个整数,还给定一个整数X,可以从n个数中选取任意个数的元素,使这些元素的最小公倍数为X,如果存在则返回Possible,否则返回Impossible.#include #include #include #include #include #include #include #include #include #include #includ原创 2014-03-05 12:40:47 · 958 阅读 · 0 评论