上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 28 下一页
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1018来源:牛客网 题目描述 Farmer John is on a boat seeking fabled treasure on one of the N (1 <= N <= 100) islands 阅读全文
posted @ 2022-08-19 04:06 er007 阅读(8) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1017来源:牛客网 题目描述 One cow from each of N farms (1 <= N <= 1000) conveniently numbered 1..N is attending the 阅读全文
posted @ 2022-08-19 03:49 er007 阅读(35) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1016来源:牛客网 题目描述 Farmer John's farm has an outdated network of M pipes (1 <= M <= 500) for pumping milk fr 阅读全文
posted @ 2022-08-19 03:32 er007 阅读(27) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1015来源:牛客网 题目描述 Bessie has two crisp red apples to deliver to two of her friends in the herd. Of course, 阅读全文
posted @ 2022-08-18 21:14 er007 阅读(24) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1014来源:牛客网 题目描述 Bessie is running out of money and is searching for jobs. Farmer John knows this and want 阅读全文
posted @ 2022-08-18 19:44 er007 阅读(25) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1013来源:牛客网 题目描述 Farmer John has been informed of the location of a fugitive cow and wants to catch her im 阅读全文
posted @ 2022-08-18 19:08 er007 阅读(33) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1012来源:牛客网 题目描述 小雨所在的城市一共有 mmm 条地铁线,分别标号为 1 号线,2 号线,……,m 号线。整个城市一共有 nnn 个车站,编号为 1∼n1 \sim n1∼n 。其中坐 i 号线需 阅读全文
posted @ 2022-08-18 18:39 er007 阅读(27) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1011来源:牛客网 题目描述 In ICPCCamp there were n towns conveniently numbered with 1,2,…,n1, 2, \dots, n1,2,…,n co 阅读全文
posted @ 2022-08-18 17:24 er007 阅读(40) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1010来源:牛客网 题目描述 随着如今社会的不断变化,交通问题也变得越来越重要,所以市长决定建设一些公路来方便各个城市之间的贸易和交易。虽然市长的想法很好,但是他也遇到了一般人也经常头疼的问题,那就是手头的经 阅读全文
posted @ 2022-08-17 23:58 er007 阅读(25) 评论(0) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/26077/1009来源:牛客网 题目描述 众所周知,最小生成树是指使图中所有节点连通且边权和最小时的边权子集。 不过最小生成树太简单了,我们现在来思考一个稍微复杂一点的问题。 现在给定一个nnn个点,mmm条边的图,每条 阅读全文
posted @ 2022-08-17 23:35 er007 阅读(63) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 28 下一页