kZjPBD.jpg
上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 23 下一页
摘要: Warm sunshine, cool wind and a fine day, while the girl watching is pursuing in chaos. Rikka reached out her hand and got the garland on her head, fin 阅读全文
posted @ 2019-04-06 10:47 Through_The_Night 阅读(160) 评论(0) 推荐(0)
摘要: 题目描述 给定一个nxm的网格,请计算三点都在格点上的三角形共有多少个。下图为4x4的网格上的一个三角形。注意三角形的三点不能共线。 输入输出格式 输入格式: 输入一行,包含两个空格分隔的正整数m和n。 输出格式: 输出一个正整数,为所求三角形数量。 输入输出样例 输入样例#1: 复制 2 2 输出 阅读全文
posted @ 2019-04-05 00:32 Through_The_Night 阅读(142) 评论(0) 推荐(0)
摘要: 题目大意: 如果A>B,并且B>C,那么有A>C,现在A>B的条件是,A的两个元素中的至少一个大于B。 问一个人可以打败多少人。 思路: ①问题其实就是在找一个联通块,我们将元素按照x从小到大排序一下,然后相邻的两个点建一条边。 ②然后在将元素按照y从小到大排序一下,然后相邻的两个点再建一条边。 然 阅读全文
posted @ 2019-04-04 17:33 Through_The_Night 阅读(234) 评论(0) 推荐(0)
摘要: One hundred years from now, in21172117, the International Collegiate Programming Contest (of which the NCPC is a part) has expanded significantly and 阅读全文
posted @ 2019-04-02 23:23 Through_The_Night 阅读(257) 评论(0) 推荐(0)
摘要: 题目描述 有一个n行m列的黑白棋盘,你每次可以交换两个相邻格子(相邻是指有公共边或公共顶点)中的棋子,最终达到目标状态。要求第i行第j列的格子只能参与mi,j次交换。 输入输出格式 输入格式: 第一行包含两个整数n,m(1<=n, m<=20)。以下n行为初始状态,每行为一个包含m个字符的01串,其 阅读全文
posted @ 2019-04-01 18:36 Through_The_Night 阅读(185) 评论(0) 推荐(0)
摘要: 题目描述 一次舞会有n个男孩和n个女孩。每首曲子开始时,所有男孩和女孩恰好配成n对跳交谊舞。每个男孩都不会和同一个女孩跳两首(或更多)舞曲。有一些男孩女孩相互喜欢,而其他相互不喜欢(不会”单向喜欢“)。每个男孩最多只愿意和k个不喜欢的女孩跳舞,而每个女孩也最多只愿意和k个不喜欢的男孩跳舞。给出每对男 阅读全文
posted @ 2019-03-31 17:03 Through_The_Night 阅读(146) 评论(0) 推荐(0)
摘要: 题目描述 Farmer John has purchased a subscription to Good Hooveskeeping magazine for his cows, so they have plenty of material to read while waiting aroun 阅读全文
posted @ 2019-03-31 09:40 Through_The_Night 阅读(191) 评论(0) 推荐(0)
摘要: 题目描述 In an effort to better manage the grazing patterns of his cows, Farmer John has installed one-way cow paths all over his farm. The farm consists 阅读全文
posted @ 2019-03-30 17:37 Through_The_Night 阅读(172) 评论(0) 推荐(0)
摘要: 题目描述 Farmer John has decided to assemble a panoramic photo of a lineup of his N cows (1 <= N <= 200,000), which, as always, are conveniently numbered 阅读全文
posted @ 2019-03-29 22:03 Through_The_Night 阅读(248) 评论(0) 推荐(0)
摘要: 题目描述 Farmer John is considering buying more land for the farm and has his eye on N (1 <= N <= 50,000) additional rectangular plots, each with integer 阅读全文
posted @ 2019-03-28 19:41 Through_The_Night 阅读(150) 评论(0) 推荐(0)
上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 23 下一页