PAT甲级
文章平均质量分 75
CoNoDio哒
这个作者很懒,什么都没留下…
展开
-
PAT(甲级)2019年冬季考试 7-4 Cartesian Tree (30 分)
A Cartesian tree is a binary tree constructed from a sequence of distinct numbers. The tree is heap-ordered, and an inorder traversal returns the original sequence. For example, given the sequence { 8, 15, 3, 4, 1, 5, 12, 10, 18, 6 }, the min-heap Cartesia原创 2021-03-09 18:11:36 · 156 阅读 · 0 评论 -
PAT(甲级)2019年冬季考试 7-1 Good in C (20 分)
When your interviewer asks you to write “Hello World” using C, can you do as the following figure shows?Input Specification:Each input file contains one test case. For each case, the first part gives the 26 capital English letters A-Z, each in a 7×5 matr原创 2021-03-09 18:02:06 · 137 阅读 · 0 评论 -
PAT (Advanced Level) Practice 1011 World Cup Betting (20分)
PAT (Advanced Level) Practice 1011 World Cup Betting (20分)With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Africa.原创 2021-02-02 11:32:17 · 133 阅读 · 0 评论