题目链接： https://exam.upc.edu.cn/problem.php?id=4979 题目： 题目描述 Your friend from Manhattan is visiting you in Amsterdam. Because she can only stay for a short while, she wants to see as many touris...

题目链接： https://exam.upc.edu.cn/problem.php?id=5211 题目： 题目描述 In this problem, we would like to talk about unreachable sets of a directed acyclic graph G = (V, E). In mathematics a directed acycl...

题目链接： https://exam.upc.edu.cn/problem.php?id=5206 题目： 题目描述 From an evolutionary gene’s-eye perspective, the genes are immortal, and our role, the meaning of life, is to perpetuate the genes...

题目链接： https://www.luogu.org/problemnew/show/P1140 题目： 题目描述 两个基因的相似度的计算方法如下： 对于两个已知基因，例如AGTGATG和GTTAG，将它们的碱基互相对应。当然，中间可以加入一些空碱基-，例如： 这样,两个基因之间的相似度就可以用碱基之间相似度的总和来描述，碱基之间的相似度如下表所示： 那么相似度就...

题目链接： https://www.luogu.org/problemnew/show/P1880 题目： 题目描述 在一个圆形操场的四周摆放N堆石子,现要将石子有次序地合并成一堆.规定每次只能选相邻的2堆合并成新的一堆，并将新的一堆的石子数，记为该次合并的得分。 试设计出1个算法,计算出将N堆石子合并成1堆的最小得分和最大得分. 输入格式： 数据的第1行试正整数N,1≤N≤...

题目链接： https://www.luogu.org/problemnew/show/P1280 题目： 题目描述 尼克每天上班之前都连接上英特网，接收他的上司发来的邮件，这些邮件包含了尼克主管的部门当天要完成的全部任务，每个任务由一个开始时刻与一个持续时间构成。 尼克的一个工作日为N分钟，从第一分钟开始到第N分钟结束。当尼克到达单位后他就开始干活。如果在同一时刻有多个任务需...

题目链接： https://exam.upc.edu.cn/problem.php?id=5561 题目： 题目描述 In a 10-dollar shop, everything is worthy 10 dollars or less. In order to serve customers more effectively at the cashier, change nee...

题目链接： https://exam.upc.edu.cn/problem.php?id=5559 题目： 题目描述 5G is the proposed next telecommunications standards beyond the current 4G standards. 5G planning aims at higher capacity than curren...

题目链接： https://exam.upc.edu.cn/problem.php?id=5556 题目： 题目描述 Consider a square map with N × N cells. We indicate the coordinate of a cell by (i, j), where 1 ≤ i, j ≤ N . Each cell has a color ei...

题目链接： https://exam.upc.edu.cn/problem.php?id=5579 题目： 题目描述 Snuke is having another barbeque party. This time, he will make one serving of Skewer Meal. He has a stock of N Skewer Meal Packs. ...