| ID | Title | C/C++ code | Remark |
|---|---|---|---|
| 1001 | A+B Format (20) | code | String handling |
| 1002 | A+B for Polynomials (25) | code | simulation |
| 1003 | Emergency (25) | code | Dijkstra's algorithm |
| 1004 | Counting Leaves (30) | code | BFS, DFS, level-order traversal of trees |
| 1005 | Spell It Right (20) | code | String handling |
| 1006 | Sign In and Sign Out (25) | code | find element |
| 1007 | Maximum Subsequence Sum(25) | code | Dynamic Programming, Maximum Continuous Subsequence and |
| 1008 | Elevator (20) | code | math problem |
| 1009 | Product of Polynomials (25) | code | simulation |
| 1010 | Radix (25) | code | dichotomy |
| 1011 | World Cup Betting (20) | code | find element |
| 1012 | The Best Rank (25) | code | sort |
| 1013 | Battle Over Cities (25) | code | Graph traversal, count the number of connected components, DFS |
| 1014 | Waiting in Line (30) | code | Application of queue |
| 1015 | Reversible Primes (20) | code | Prime number |
| 1016 | Phone Bills (25) | code | sort |
| 1017 | Queueing at Bank (25) | code | simulation |
| 1018 | Public Bike Management (30) | code | Dijkstra's Algorithm + DFS |
| 1019 | General Palindromic Number (20) | code | number of palindromes |
| 1020 | Tree Traversals (25) | code | base conversion |
| 1021 | Deepest Root (25) | code | Traversal of the graph, DFS, calculating the number of connected components |
| 1022 | Digital Library (30) | code | map mapping, the use of STL |
| 1023 | Have Fun with Numbers (20) | code | big integer arithmetic |
| 1024 | Palindromic Number (25) | code | big integer addition |
| 1025 | PAT Ranking (25) | code | sort |
| 1026 | Table Tennis (30) | code | simulate, sort |
| 1027 | Colors in Mars (20) | code | base conversion |
| 1028 | List Sorting (25) | code | sort |
| 1029 | Median (25) | code | two pointers |
| 1030 | Travel Plan (30) | code | Dijkstra's Algorithm + DFS, Shortest Path, Edge Weights |
| 1031 | Hello World for U (20) | code | Graphic printing |
| 1032 | Sharing (25) | code | linked list |
| 1033 | To Fill or Not to Fill (25) | code | how are you |
| 1034 | Head of a Gang (30) | code | Graph Traversal, DFS |
| 1035 | Password (20) | code | String handling |
| 1036 | Boys vs Girls (25) | code | find element |
| 1037 | Magic Coupon (25) | code | how are you |
| 1038 | Recover the Smallest Number (30) | code | how are you |
| 1039 | Course List for Student (25) | code | Variable-length array vector, the use of STL |
| 1040 | Longest Symmetric String (25) | code | dynamic programming |
| 1041 | Be Unique (20) | code | Hash |
| 1042 | Shuffling Machine (20) | code | simulation |
| 1043 | Is It a Binary Search Tree (25) | code | Binary Search Tree BST |
| 1044 | Shopping in Mars (25) | code | binary search |
| 1045 | Favorite Color Stripe (30) | code | Dynamic Programming, LIS/LCS |
| 1046 | Shortest Distance (20) | code | simulation |
| 1047 | Student List for Course (25) | code | Variable-length array vector, the use of STL |
| 1048 | Find Coins (25) | code | Hash |
| 1049 | Counting Ones (30) | code | math problem |
| 1050 | String Subtraction (20) | code | Hash |
| 1051 | Pop Sequence (25) | code | stack simulation |
| 1052 | Linked List Sorting (25) | code | linked list |
| 1053 | Path of Equal Weight (30) | code | tree traversal |
| 1054 | The Dominant Color (20) | code | map mapping, the use of STL |
| 1055 | The World’s Richest (25) | code | sort |
| 1056 | Mice and Rice (25) | 代码 | queue的用法 |
| 1057 | Stack (30) | 代码 | 树状数组 |
| 1058 | A+B in Hogwarts (20) | 代码 | 进制转换 |
| 1059 | Prime Factors (25) | 代码 | 素数表的建立 |
| 1060 | Are They Equal (25) | 代码 | 科学计数法 |
| 1061 | Dating (20) | 代码 | 字符串处理 |
| 1062 | Talent and Virtue (25) | 代码 | 排序 |
| 1063 | Set Similarity (25) | 代码 | 集合set，STL的使用 |
| 1064 | Complete Binary Search Tree (30) | 代码 | 二叉查找树BST |
| 1065 | A+B and C (64bit) (20) | 代码 | 模拟 |
| 1066 | Root of AVL Tree (25) | 代码 | 平衡二叉树（AVL树） |
| 1067 | Sort with Swap(0,*) (25) | 代码 | 贪心算法 |
| 1068 | Find More Coins (30) | 代码 | 01背包，动态规划 |
| 1069 | The Black Hole of Numbers (20) | 代码 | 数学问题 |
| 1070 | Mooncake (25) | 代码 | 贪心算法 |
| 1071 | Speech Patterns (25) | 代码 | map映射，STL的使用 |
| 1072 | Gas Station (30) | 代码 | Dijkstra算法 |
| 1073 | Scientific Notation (20) | 代码 | 字符串处理 |
| 1074 | Reversing Linked List (25) | 代码 | 链表 |
| 1075 | PAT Judge (25) | 代码 | 排序 |
| 1076 | Forwards on Weibo (30) | 代码 | 图的遍历，BFS |
| 1077 | Kuchiguse (20) | 代码 | 字符串处理 |
| 1078 | Hashing (25) | 代码 | 二次方探查法 |
| 1079 | Total Sales of Supply Chain (25) | 代码 | DFS，BFS，树的遍历 |
| 1080 | Graduate Admission (30) | 代码 | 排序 |
| 1081 | Rational Sum (20) | 代码 | 分数的四则运算 |
| 1082 | Read Number in Chinese (25) | 代码 | 字符串处理 |
| 1083 | List Grades (25) | 代码 | 排序 |
| 1084 | Broken Keyboard (20) | 代码 | Hash散列 |
| 1085 | Perfect Sequence (25) | 代码 | 二分，two pointers |
| 1086 | Tree Traversals Again (25) | 代码 | 树的遍历 |
| 1087 | All Roads Lead to Rome (30) | 代码 | Dijkstra算法 + DFS，最短路径 |
| 1088 | Rational Arithmetic (20) | 代码 | 分数的四则运算 |
| 1089 | Insert or Merge (25) | 代码 | two pointers |
| 1090 | Highest Price in Supply Chain (25) | 代码 | 树的遍历 |
| 1091 | Acute Stroke (30) | 代码 | 广度优先搜索BFS |
| 1092 | To Buy or Not to Buy (20) | 代码 | Hash散列 |
| 1093 | Count PAT’s (25) | 代码 | 逻辑题 |
| 1094 | The Largest Generation (25) | 代码 | BFS，DFS，树的遍历 |
| 1095 | Cars on Campus (30) | 代码 | map的用法，排序 |
| 1096 | Consecutive Factors (20) | 代码 | 逻辑题 |
| 1097 | Deduplication on a Linked List (25) | 代码 | 链表 |
| 1098 | Insertion or Heap Sort (25) | 代码 | heap sort（堆排序） |
| 1099 | Build A Binary Search Tree (30) | 代码 | 二叉查找树BST |
| 1100 | Mars Numbers (20) | 代码 | map映射，STL的使用 |
| 1101 | Quick Sort (25) | 代码 | 快速排序 |
| 1102 | Invert a Binary Tree (25) | 代码 | 树的遍历 |
| 1103 | Integer Factorization (30) | 代码 | 深度优先搜索DFS |
| 1104 | Sum of Number Segments (20) | 代码 | 数学问题 |
| 1105 | Spiral Matrix (25) | 代码 | 模拟 |
| 1106 | Lowest Price in Supply Chain (25) | 代码 | DFS，BFS，树的遍历 |
| 1107 | Social Clusters (30) | 代码 | 并查集 |
| 1108 | Finding Average (20) | 代码 | 字符串处理 |
| 1109 | Group Photo (25) | 代码 | 逻辑题 |
| 1110 | Complete Binary Tree (25) | 代码 | 完全二叉树 |
| 1111 | Online Map (30) | 代码 | Dijkstra算法 + DFS |
| 1112 | Stucked Keyboard (20) | 代码 | map映射，STL的使用 |
| 1113 | Integer Set Partition (25) | 代码 | 排序 |
| 1114 | Family Property (25) | 代码 | 并查集 |
| 1115 | Counting Nodes in a BST (30) | 代码 | 二叉树的遍历，DFS |
| 1116 | Come on! Let’s C (20) | 代码 | 简单逻辑题 |
| 1117 | Eddington Number(25) | 代码 | 简单逻辑题 |
| 1118 | Birds in Forest (25) | 代码 | 并查集 |
| 1119 | Pre- and Post-order Traversals (30) | 代码 | 前序后序转中序 |
| 1120 | Friend Numbers (20) | 代码 | set的应用 |
| 1121 | Damn Single (25) | 代码 | set的应用 |
| 1122 | Hamiltonian Cycle (25) | 代码 | 图论 |
| 1123 | Is It a Complete AVL Tree (30) | 代码 | AVL树 |
| 1124 | Raffle for Weibo Followers (20) | 代码 | map映射 |
| 1125 | Chain the Ropes (25) | 代码 | 排序，贪心 |
| 1126 | Eulerian Path (25) | 代码 | 连通图 |
| 1127 | ZigZagging on a Tree (30) | 代码 | 中序后序建树，层序遍历 |
| 1128 | N Queens Puzzle (20) | 代码 | 逻辑题 |
| 1129 | Recommendation System (25) | 代码 | set的应用，运算符重载 |
| 1130 | Infix Expression (25) | 代码 | dfs深度优先搜索 |
| 1131 | Subway Map (30) | 代码 | dfs深度优先搜索 |
| 1132 | Cut Integer (20) | 代码 | 数学问题 |
| 1133 | Splitting A Linked List (25) | 代码 | 链表 |
| 1134 | Vertex Cover (25) | 代码 | hash散列 |
| 1135 | Is It A Red-Black Tree (30) | 代码 | 红黑树 |
| 1136 | A Delayed Palindrome (20) | 代码 | 简单题 |
| 1137 | Final Grading (25) | 代码 | map映射，排序 |
| 1138 | Postorder Traversal (25) | 代码 | 树的遍历，前序中序转后序 |
| 1139 | First Contact (30) | 代码 | 模拟 |
| 1140 | Look-and-say Sequence (20) | 代码 | 字符串处理 |
| 1141 | PAT Ranking of Institutions (25) | 代码 | 排序，map STL |
| 1142 | Maximal Clique (25) | 代码 | 图论，无向完全图 |
| 1143 | Lowest Common Ancestor (30) | 代码 | 水题 |
| 1144 | The Missing Number (20) | 代码 | STL，map |
| 1145 | Hashing – Average Search Time (25) | 代码 | 哈希映射，哈希表，平方探测法 |
| 1146 | Topological Order (25) | 代码 | 拓扑排序 |
| 1147 | Heaps (30) | 代码 | 堆，树的遍历 |
PAT Grade A Problem Solving Catalog
Guess you like
Origin http://43.154.161.224:23101/article/api/json?id=325651086&siteId=291194637
Recommended
Ranking