鸿杰 的博客

Team Formation Time Limit: 2 Seconds Memory Limit: 131072 KB For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his uni...

H - Holy Grail As the current heir of a wizarding family with a long history,unfortunately, you find yourself forced to participate in the cruel Holy Grail War which has a reincarnation of sixty years...

掷骰子的N种方法 这里有 ddd 个一样的骰子，每个骰子上都有 fff 个面，分别标号为 1,2,...,f1, 2, ..., f1,2,...,f。 我们约定：掷骰子的得到总点数为各骰子面朝上的数字的总和。 如果需要掷出的总点数为 targettargettarget，请你计算出有多少种不同的组合情况（所有的组合情况总共有fdf^dfd 种），模 109+710^9 + 7109+7 后返回。...

abc137_D - Summer Vacation Problem Statement There are NNN one-off jobs available. If you take the i-th job and complete it, you will earn the reward of BiB_iBi​ after AiA_iAi​ days from the day you ...

文章目录[Problem A 小L的项链切割](http://acm.zzuli.edu.cn/problem.php?id=1526)[Problem B 小L的试卷](http://acm.zzuli.edu.cn/problem.php?id=1527)[Problem C 小L记单词](http://acm.zzuli.edu.cn/problem.php?id=2041)[Prob...

Vacation Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1060 Accepted Submission(s): 420 Special Judge Problem Description Tom and Jerry...

1530: 小L玩滚球游戏 时间限制: 1 Sec 内存限制: 128 MB 提交: 54 解决: 18 题目描述 小L正在玩滚球游戏，有n个水晶球在轨道上以不同开始位置和速度从近往远的方向滚动，如果两个水晶球在滚动过程中相遇，它们就会融合成一个水晶球，然后以速度较慢的水晶球的速度继续向前滚动， 问经过时间t后，轨道上还有多少水晶球。 输入 第一行输入两个整数n、t，n代表水晶球的数量（1 &...

食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 105782 Accepted: 32027 Description 动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。 有人用两种...

Proving Equivalences Problem Description Consider the following exercise, found in a generic linear algebra textbook. Let A be an n × n matrix. Prove that the following statements are equivalent: A i...

有趣的数 时间限制：3000 ms | 内存限制：65535 KB 难度：2 描述 把分数按下面的办法排成一个数表。 1/1 1/2 1/3 1/4… 2/1 2/2 2/3… 3/1 3/2 … 4/1… … 我们以z字型方法给上表的每项编号。特定方法：第一项是1/1，然后是1/2、2/1、3/1、2/2、1/3、1/4、2/3……。编程输入项号N（1<=N<=100000），输...

Beauty of Array Time Limit: 2 Seconds Memory Limit: 65536 KB Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now E...

Hua Rong Dao Accept: 523 Submit: 1086 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description Cao Cao was hunted down by thousands of enemy soldiers when he escaped from Hua Rong Dao. ...

C. Powers Of Two A positive integer x is called a power of two if it can be represented as x=2yx=2^yx=2y, where y is a non-negative integer. So, the powers of two are 1,2,4,8,16,…. You are given two p...

C. Yuhao and a Parenthesis One day, Yuhao came across a problem about checking if some bracket sequences are correct bracket sequences. A bracket sequence is any non-empty sequence of opening and clos...

Divide by three, multiply by two Polycarp likes to play with numbers. He takes some integer number x, writes it down on the board, and then performs with it n−1 operations of the two kinds: divide the...

C. Prefixes and Suffixes Ivan wants to play a game with you. He picked some string s of length n consisting only of lowercase Latin letters. You don’t know this string. Ivan has informed you about all...

蛇形填数 时间限制：3000 ms | 内存限制：65535 KB 难度：3 描述 在nn方陈里填入1,2,…,nn,要求填成蛇形。例如n=4时方陈为： 10 11 12 1 9 16 13 2 8 15 14 3 7 6 5 4 输入 直接输入方陈的维数，即n的值。(n<=100) 输出 输出结果是蛇形方陈。 样例输入 3 样例输出 7 8 1 6 9 2 5 4 3 #includ...