最新 最热

HDOJ 1028 Ignatius and the Princess III(递推)

Problem Description “Well, it seems the first problem is too easy. I will let you know how foolish you are later.” feng5166 says.

2021-01-21
0

HDOJ 1098 Ignatius's puzzle

Problem Description Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^...

2021-01-21
0

HDOJ 1018 Big Number(大数位数公式)

Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, ...

2021-01-21
0

HDOJ/HDU 1321 Reverse Text(倒序输出~)

Problem Description In most languages, text is written from left to right. However, there are other languages where text is read and written from right to lef...

2021-01-21
0

HDOJ/HDU 1062 Text Reverse(字符串翻转~)

Problem Description Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words a...

2021-01-21
0

HDOJ 1040 As Easy As A+B

Problem Description These days, I am thinking about a question, how can I get a problem as easy as

2021-01-20
0

HDOJ 2058 The sum problem

Problem Description Given a sequence 1,2,3,……N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.

2021-01-20
0

POJ 1423 Big Number

In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In th...

2021-01-20
1

​LeetCode刷题实战60:第k个排列

https://leetcode-cn.com/problems/permutation-sequence/

2021-01-20
1

POJ 2533 Longest Ordered Subsequence

A numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), w...

2021-01-19
1