PAT刷题之路
记录PAT题目和解题思路,代码
KrissLong
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
1009 Product of Polynomials (25分)
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 occupies 2 lines, and each line contains the information of a polynomial:KN1aN1N2aN2...NK原创 2020-08-19 23:13:10 · 140 阅读 · 0 评论 -
1007 Maximum Subsequence Sum (25分)
Given a sequence of K integers N1,N2,...,NK{ N1 , N2 , ..., NK }N1,N2,...,NK. A continuous subsequence is defined to be Ni,Ni+1,...,Nj{ Ni , Ni+1 , ..., Nj }Ni,Ni+1,...,Nj where 1≤i≤j≤K. T原创 2020-08-19 23:00:20 · 214 阅读 · 0 评论 -
1006 Sign In and Sign Out (25分)
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you are supposed to find the ones who have unlocked and loc原创 2020-08-19 22:56:13 · 155 阅读 · 0 评论 -
1002 A+B for Polynomials (25分)
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 occupies 2 lines, and each line contains the information of a polynomial:KN 1aN1N2aN2.原创 2020-08-19 22:44:03 · 140 阅读 · 0 评论 -
1004 Counting Leaves (30分)
1004 Counting Leaves (30分)A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts with a line containing 0<N&原创 2020-08-19 22:22:28 · 143 阅读 · 0 评论
分享