上一页 1 ··· 52 53 54 55 56 57 58 59 60 ··· 87 下一页
摘要: http://poj.org/problem?id=1258 Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connecti 阅读全文
posted @ 2018-10-08 20:34 _Zlrrr 阅读(174) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=1703 Description The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs 阅读全文
posted @ 2018-10-08 20:33 _Zlrrr 阅读(142) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=2421 There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can 阅读全文
posted @ 2018-10-05 16:30 _Zlrrr 阅读(142) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=1287 You are assigned to design network connections between certain points in a wide area. You are given a set of points in 阅读全文
posted @ 2018-10-05 14:23 _Zlrrr 阅读(187) 评论(0) 推荐(0)
摘要: #include using namespace std; const int maxn = 5e5 + 10; int h[maxn], v[maxn], nx[maxn], in[maxn]; int n, m, sz; void add(int a, int b) { v[sz] = b; nx[sz] = h[a]; h[a] = sz; in[b] ++; s... 阅读全文
posted @ 2018-10-05 11:06 _Zlrrr 阅读(124) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=1251 The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads 阅读全文
posted @ 2018-10-05 10:40 _Zlrrr 阅读(141) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=1797 Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. 阅读全文
posted @ 2018-10-03 13:28 _Zlrrr 阅读(140) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=2387 Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes 阅读全文
posted @ 2018-09-30 17:22 _Zlrrr 阅读(179) 评论(0) 推荐(0)
摘要: http://acm.ocrosoft.com/problem.php?cid=1316&pid=8 题目描述 浙江杭州某镇共有n个人,请找出该镇上的前m个大富翁. 浙江杭州某镇共有n个人,请找出该镇上的前m个大富翁. 输入 输入包含多组测试用例. 每个用例首先包含2个整数n(0<n<=100000 阅读全文
posted @ 2018-09-30 11:32 _Zlrrr 阅读(414) 评论(0) 推荐(0)
摘要: http://acm.ocrosoft.com/problem.php?cid=1316&pid=11 题目描述 求两个大的正整数相减的差。 求两个大的正整数相减的差。 输入 共2行,第1行是被减数a,第2行是减数b(a > b)。每个大整数不超过200位,不会有多余的前导零。 共2行,第1行是被减 阅读全文
posted @ 2018-09-30 11:25 _Zlrrr 阅读(281) 评论(0) 推荐(0)
上一页 1 ··· 52 53 54 55 56 57 58 59 60 ··· 87 下一页