Tanglouis2017的博客

新生晚会 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13920    Accepted Submission(s): 4781 Problem Description 开学了，杭电又迎来了好多新生。ACMer想为新生

a/b + c/d Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13956    Accepted Submission(s): 7293 Problem Description 给你2个分数，求他们的和，并要求和为最

又见GCD Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18109    Accepted Submission(s): 7542 Problem Description 有三个正整数a,b,c(0   I

TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its delicious dishes. Today n groups of customers come to enjoy their meal, an

N! (N factorial) can be quite irritating and difficult to compute for large values of N. So instead of calculating N!, I want to know how many digits are in it. (Remember that N! = N * (N - 1) * (N -

升降序列的定义如下：给定N个不同的整数a1,a2,…,aN组成的集合，其中N为奇数，在这N个整数集合的一个排列中，如果对于所有1i-1 i > ai+1，那么称该序列为升降序列。  给定N个不同的整数组成的集合，请你构造出一个升降序列，使得该升降序列的字典序最小。  对于有N个元素的两个整数序列A和B，如果存在下标k，使得AkBk，并且对于所有1≤i Input 输入数