![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PAT甲级
文章平均质量分 80
SpareLin
这个作者很懒,什么都没留下…
展开
-
1164 Good in C
When your interviewer asks you to write "Hello World" using C, can you do as the following figure shows?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 matrix of 's and 's. Then原创 2022-06-30 21:17:20 · 308 阅读 · 0 评论 -
1163 Dijkstra Sequence
Dijkstra's algorithm is one of the very famous greedy algorithms. It is used for solving the single source shortest path problem which gives the shortest paths from one particular source vertex to all the other vertices of the given graph. It was conceived原创 2022-06-29 19:43:05 · 287 阅读 · 0 评论 -
1162 Postfix Expression
Given a syntax tree (binary), you are supposed to output the corresponding postfix expression, with parentheses reflecting the precedences of the operators.Each input file contains one test case. For each case, the first line gives a positive integer N (≤原创 2022-06-28 19:07:20 · 521 阅读 · 0 评论 -
PAT甲级 1065 A+B and C (64bit) (20 分)
1065 A+B and C (64bit) (20 分) Given three integersA,BandCin (−263,263), you are supposed to tell whetherA+B>C. Input Specification: The first line of the input gives the positive number of test cases,T(≤10). ThenTtest cases follow, each con...原创 2022-01-31 00:58:36 · 666 阅读 · 0 评论