## 1007. Maximum Subsequence Sum (25)-PAT甲级真题（最大连续子序列和、动态规划dp）

Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 <= i <= j <= K. The M[……]

## 1009. Product of Polynomials (25)-PAT甲级真题

This time, you are supposed to find A*B where A and B are two polynomials.

#### Input Specification:

Each input file contains one test case. Each case oc[……]

## 1112. Stucked Keyboard (20)-PAT甲级真题

On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear rep[……]

## 1110. Complete Binary Tree (25)-PAT甲级真题（BFS）

Given a tree, you are supposed to tell if it is a complete binary tree.

#### Input Specification:

Each input file contains one test case. For each case,[……]

## 1116. Come on! Let’s C (20)-PAT甲级真题

“Let’s C” is a popular and fun programming contest hosted by the College of Computer Science and Technology, Zhejiang University. Since the idea of th[……]