随笔分类 - ACM/ICPC
摘要：题目描述 已知两个非降序链表序列S1与S2，设计函数构造出S1与S2的交集新链表S3。 输入描述 输入分两行，分别在每行给出由若干个正整数构成的非降序序列，用−1表示序列的结尾（−1不属于这个序列）。数字用空格间隔。 输出描述 在一行中输出两个输入序列的交集序列，数字间用空格分开，结尾不能有多余空格
阅读全文
摘要：In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program, whether the program w
阅读全文
摘要：BaoBao is taking a walk in the interval [0,n] on the number axis, but he is not free to move, as at every point (i−0.5) for all i∈[1,n], where iis an
阅读全文
摘要：BaoBao has a sequence a1,a2,...,an. He would like to find a subset Sof {1,2,...,n} such that ∀i,j∈S, ai⊕aj<min(ai,aj) and ∣S∣ is
阅读全文
摘要：DreamGrid is playing the music game Live Love. He has just finished a song consisting of n notes and got a result sequence A1,A2,...,An (Ai
阅读全文
摘要：There are NN children in kindergarten. Miss Li bought them NN candies. To make the process more interesting, Miss Li comes up with the rule: All the c
阅读全文
摘要：Bob is a sorcerer. He lives in a cuboid room which has a length of AA, a width of BB and a height of CC, so we represent it as AA * BB * CC. One day,
阅读全文
摘要：Every morning she will ask the mirror: 'Mirror mirror tell me, who is the most beautiful girl in the world?' If the mirror says her name, she will pra
阅读全文
摘要：Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat video. To do this, he extracts cat f
阅读全文
摘要：题目描述 People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". An
阅读全文
摘要：Ⅰ基本函数： 1.valueOf(parament); 将参数转换为制定的类型 比如 int a=3; BigInteger b=BigInteger.valueOf(a); 则b=3; String s=”12345”; BigInteger c=BigInteger.valueOf(s); 则c
阅读全文
摘要：Mur loves hash algorithm, and he sometimes encrypt another one's name, and call him with that encrypted value. For instance, he calls Kimura KMR, and
阅读全文
摘要：A prime number (or a prime) is a natural number greater than 11 that cannot be formed by multiplying two smaller natural numbers. Now lets define a nu
阅读全文
摘要：A. Function Height time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given a set of
阅读全文
摘要：链接：https://www.nowcoder.com/acm/contest/185/C 来源：牛客网 题目描述 给出一个数列 A，求出一个数列B. 其中Bi 表示 数列A中 Ai 右边第一个比 Ai 大的数的下标(从1开始计数),没有找到这一个下标 Bi 就为0 输出数列B 输入描述: 第一行1
阅读全文
摘要：链接：https://www.nowcoder.com/acm/contest/180/A 来源：牛客网 题目描述 小a的平面上有n个X型不明物体，但是他不确定他们的位置。现在请你来确定他们的位置，使得划分形成的平面尽量多 输入描述: 一个整数n，如题所示 输出描述: 一个整数，表示最多把平面分成多
阅读全文
摘要：链接：https://www.nowcoder.com/acm/contest/185/D 来源：牛客网 题目描述 Johnson和Nancy要在星光下吃晚餐。这是一件很浪漫的事情。 为了增加星光晚餐那浪漫的氛围，他拿出了一个神奇的魔法棒，并且可以按照一定的规则，改变天上星星的亮暗。 Johnson
阅读全文
摘要：题目描述 给定一个无向图和其中的所有边，判断这个图是否所有顶点都是连通的。 输入 每组数据的第一行是两个整数 n 和 m（0<=n<=1000）。n 表示图的顶点数目，m 表示图中边的数目。如果 n 为 0 表示输入结束。随后有 m 行数据，每行有两个值 x 和 y（0<x, y <=n），表示顶点
阅读全文
摘要：一切杀不死我的，都将使我强大！ 题目网站： http://codeup.cn/problem.php?cid=100000620&pid=0 题目描述 该题的目的是要你统计图的连通分支数。 输入 每个输入文件包含若干行，每行两个整数i,j，表示节点i和j之间存在一条边。 输出 输出每个图的联通分支数
阅读全文
摘要：一切杀不死我的，都将使我强大！ 1076 Forwards on Weibo（30 分） Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may foll
阅读全文
浙公网安备 33010602011771号