09 2017 档案

 
2016ICPC-大连 A Simple Math Problem (数学)
摘要:Given two positive integers a and b,find suitable X and Y to meet the conditions: X+Y=a Least Common Multiple (X, Y) =bInputInput includes multiple se 阅读全文
posted @ 2017-09-29 19:16 Annetree 阅读(191) 评论(0) 推荐(0)
2016ICPC-大连 Convex (几何)
摘要:We have a special convex that all points have the same distance to origin point. As you know we can get N segments after linking the origin point and 阅读全文
posted @ 2017-09-29 19:12 Annetree 阅读(253) 评论(0) 推荐(0)
2016ICPC-大连 To begin or not to begin (简单思维)
摘要:A box contains black balls and a single red ball. Alice and Bob draw balls from this box without replacement, alternating after each draws until the r 阅读全文
posted @ 2017-09-29 19:09 Annetree 阅读(378) 评论(0) 推荐(0)
2017ICPC南宁赛区网络赛 Minimum Distance in a Star Graph (bfs)
摘要:In this problem, we will define a graph called star graph, and the question is to find the minimum distance between two given nodes in the star graph. 阅读全文
posted @ 2017-09-26 13:09 Annetree 阅读(374) 评论(0) 推荐(0)
2017ICPC南宁赛区网络赛 Overlapping Rectangles(重叠矩阵面积和=离散化模板)
摘要:There are nnn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with 阅读全文
posted @ 2017-09-26 13:05 Annetree 阅读(263) 评论(0) 推荐(0)
2017ICPC南宁赛区网络赛 The Heaviest Non-decreasing Subsequence Problem (最长不下降子序列)
摘要:Let SSS be a sequence of integers s1s_{1}s​1​​, s2s_{2}s​2​​, ........., sns_{n}s​n​​ Each integer is is associated with a weight by the following rul 阅读全文
posted @ 2017-09-25 20:45 Annetree 阅读(265) 评论(0) 推荐(0)
2017ICPC南宁赛区网络赛 Train Seats Reservation (简单思维)
摘要:You are given a list of train stations, say from the station 111 to the station 100100100. The passengers can order several tickets from one station t 阅读全文
posted @ 2017-09-25 20:40 Annetree 阅读(303) 评论(0) 推荐(0)
2017ICPC北京赛区网络赛 Minimum(数学+线段树)
摘要:描述 You are given a list of integers a0, a1, …, a2^k-1. You need to support two types of queries: 1. Output Minx,y∈[l,r] {ax∙ay}. 2. Let ax=y. 输入 The f 阅读全文
posted @ 2017-09-25 20:35 Annetree 阅读(182) 评论(0) 推荐(0)
2017ICPC北京赛区网络赛 Visiting Peking University(简单思维)
摘要:描述 Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1, 2, …, n-1. He plans to spend m consecutive da 阅读全文
posted @ 2017-09-25 20:29 Annetree 阅读(280) 评论(0) 推荐(0)
PAT乙级 1014. 福尔摩斯的约会 (20)
摘要:大侦探福尔摩斯接到一张奇怪的字条:“我们约会吧! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm”。大侦探很快就明白了,字条上奇怪的乱码实际上就是约会的时间“星期四 14:04”,因为前面两字符串中第1对相同的大写英文字母(大小写有区分)是 阅读全文
posted @ 2017-09-16 10:44 Annetree 阅读(170) 评论(0) 推荐(0)
PAT乙级 1010. 一元多项式求导 (25)
摘要:设计函数求一元多项式的导数。(注:xn(n为整数)的一阶导数为n*xn-1。) 输入格式:以指数递降方式输入多项式非零项系数和指数(绝对值均为不超过1000的整数)。数字间以空格分隔。 输出格式:以与输入相同的格式输出导数多项式非零项的系数和指数。数字间以空格分隔,但结尾不能有多余空格。注意“零多项 阅读全文
posted @ 2017-09-16 10:14 Annetree 阅读(183) 评论(0) 推荐(0)
PAT乙级 1005. 继续(3n+1)猜想 (25)
摘要:卡拉兹(Callatz)猜想已经在1001中给出了描述。在这个题目里,情况稍微有些复杂。 当我们验证卡拉兹猜想的时候,为了避免重复计算,可以记录下递推过程中遇到的每一个数。例如对n=3进行验证的时候,我们需要计算3、5、8、4、2、1,则当我们对n=5、8、4、2进行验证的时候,就可以直接判定卡拉兹 阅读全文
posted @ 2017-09-16 09:44 Annetree 阅读(121) 评论(0) 推荐(0)