{"id":18527902,"url":"https://github.com/nemonameless/pat_advanced-and-algorithm","last_synced_at":"2025-05-14T21:33:19.460Z","repository":{"id":118412906,"uuid":"79509824","full_name":"nemonameless/PAT_Advanced-And-Algorithm","owner":"nemonameless","description":"Algorithm practice : PAT_Advanced","archived":false,"fork":false,"pushed_at":"2018-02-21T13:43:41.000Z","size":106,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-17T06:30:26.905Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nemonameless.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-01-20T00:37:10.000Z","updated_at":"2019-11-20T18:51:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"92f9f4ca-07b0-458f-9ec9-3e3686505fbd","html_url":"https://github.com/nemonameless/PAT_Advanced-And-Algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FPAT_Advanced-And-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FPAT_Advanced-And-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FPAT_Advanced-And-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FPAT_Advanced-And-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nemonameless","download_url":"https://codeload.github.com/nemonameless/PAT_Advanced-And-Algorithm/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254231406,"owners_count":22036363,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-06T17:56:16.378Z","updated_at":"2025-05-14T21:33:19.417Z","avatar_url":"https://github.com/nemonameless.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"## PAT_Advanced And Algorithm\n来源：      \nhttps://www.patest.cn/contests/pat-a-practise    \nhttps://www.logn.me/problem/list    \nhttp://codeup.cn/problemset.php    \n### 题型分类\n主要是PAT甲级：www.patest.cn/contests/pat-a-practise/1001 后四位数即题目ID      \n加题目链接的题为较难题\n### 三、入门模拟\n##### 3.1 简单模拟\n1002\tA+B for Polynomials (25)     \n1042\tShuffling Machine (20)               \n1046\tShortest Distance (20)     \n1065\tA+B and C (64bit) (20)           \n1009\tProduct of Polynomials (25)                         \n##### 3.2 查找元素    \n1006\tSign In and Sign Out (25)\t     \n1011\tWorld Cup Betting (20)      \n1036\tBoys vs Girls (25)      \n##### 3.3 图形输出\n1031\tHello World for U (20)      \n##### 3.4 日期处理   \n##### 3.5 进制转换\n1019\tGeneral Palindromic Number (20)     \n1027\tColors in Mars (20)      \n1058\tA+B in Hogwarts (20)      \n##### 3.6 字符串处理\n1001\tA+B Format (20)    \n1005\tSpell It Right (20)\t     \n1035\tPassword (20)\t     \n1061\tDating (20)     \n1073\tScientific Notation (20)\n\u003cbr/\u003e[1077  Kuchiguse (20)](https://www.patest.cn/contests/pat-a-practise/1077)\u003c/br\u003e\n[1082\tRead Number in Chinese (25)](https://www.patest.cn/contests/pat-a-practise/1082)\n### 四、算法初步\n##### 4.1 排序\n1012\tThe Best Rank (25)\n\u003cbr/\u003e[1016\tPhone Bills (25)](https://www.patest.cn/contests/pat-a-practise/1016)\u003cbr/\u003e\n1025\tPAT Ranking (25)                 \n1028\tList Sorting (25)                   \n1055\tThe World's Richest (25)               \n1062\tTalent and Virtue (25)            \n1075\tPAT Judge (25)        \n1080\tGraduate Admission (30)               \n1083\tList Grades (25)             \n1095  Cars on Campus (30)                              \n##### 4.2 哈希\n1041\tBe Unique (20)            \n1048\tFind Coins (25)             \n1050\tString Subtraction (20)                          \n1084\tBroken Keyboard (20)                \n1092 To Buy or Not to Buy (20)                 \n##### 4.3 递归\n##### 4.4 贪心\n1033\tTo Fill or Not to Fill (25)               \n1037\tMagic Coupon (25)                  \n1038\tRecover the Smallest Number (30)                        \n1067\tSort with Swap(0,※) (25)       \n1070\tMooncake (25)                  \n##### 4.5 二分\n1010\tRadix (25)    \n1044\tShopping in Mars (25)     \n1048\tFind Coins (25)      \n1085\tPerfect Sequence (25)    \n##### 4.6 two pointers\n1029\tMedian (25)    \n1048\tFind Coins (25)     \n1085\tPerfect Sequence (25)      \n1089\tInsert or Merge (25)       \n##### 4.7 高效技巧题\n1093\tCount PAT’s (25)           \n1101\tQuick Sort (25)        \n### 五、数学问题\n##### 5.1 简单数学\n1008\tElevator (20)         \n1049\tCounting Ones (30)        \n1069\tThe Black Hole of Numbers (20)        \n1104\tSum of Number Segments (20)    \n##### 5.2 gcd\n1008  数组元素循环右移问题 (20)        \n##### 5.3 分数的四则运算\n1081\tRational Sum (20)\t     \n1088\tRational Arithmetic (20)     \n##### 5.4 素数\n1015\tReversible Primes (20)          \n1078\tHashing (25)    \n##### 5.5 质因子分解\n1059\tPrime Factors (25)            \n1096\tConsecutive Factors (20)                       \n##### 5.6 大整数运算\n1023\tHave Fun with Numbers (20)                      \n1024\tPalindromic Number (25)                     \n##### 5.7 扩展欧几里得算法\n##### 5.8 组合数\n### 六、C++标准模板库STL\n##### 6.1 vector\n1039\tCourse List for Student (25)       \n1047\tStudent List for Course (25)      \n##### 6.2 set\n1063\tSet Similarity (25)       \n##### 6.3 string\n1060\tAre They Equal (25)    \n##### 6.4 map\n1022\tDigital Library (30)   \n1054\tThe Dominant Color (20)   \n1071\tSpeech Patterns (25)    \n1100\tMars Numbers (20)     \n### 七、数据结构（1）\n##### 7.1 栈stack\n1051\tPop Sequence (25)   \n##### 7.2 队列queue、priority_queue\n1056\tMice and Rice (25)\n##### 7.3 链表处理\n1032\tSharing (25)     \n1052\tLinked List Sorting (25)     \n1074\tReversing Linked List (25)     \n1097\tDeduplication on a Linked List (25)    \n### 八、搜索专题\n##### 8.1 深度优先搜寻DFS\n1103\tInteger Factorization (30)     \n##### 8.2 广度优先搜寻BFS\n1091\tAcute Stroke (30)      \n### 九、数据结构（2）--树、二叉树\n##### 9.2 二叉树遍历 \n1020\tTree Traversals (25)     \n1086\tTree Traversals Again (25)       \n1102\tInvert a Binary Tree (25)         \n##### 9.3 树的遍历\n1004\tCounting Leaves (30)    \n1053\tPath of Equal Weight (30)     \n1079\tTotal Sales of Supply Chain (25)    \n1090\tHighest Price in Supply Chain (25)    \n1094\tThe Largest Generation (25)    \n1106\tLowest Price in Supply Chain (25)       \n##### 9.4 二叉排序树BST\n1043\tIs It a Binary Search Tree (25)     \n1064\tComplete Binary Search Tree (30)      \n1099\tBuild A Binary Search Tree (30)       \n##### 9.5 平衡二叉树AVL\n1066\tRoot of AVL Tree (25)    \n##### 9.6 并查集\n1107\tSocial Clusters (30)         \n1114\tFamily Property (25)           \n1118\tBirds in Forest (25)       \n##### 9.7 堆\n1098\tInsertion or Heap Sort (25)    \n##### 9.8 哈弗曼树\n### 十、图算法\n##### 10.3 图的遍历 \n1021\tDeepest Root (25)    \n1034\tHead of a Gang (30)    \n1013\tBattle Over Cities (25)    \n1076\tForwards on Weibo (30)     BFS\n##### 10.4 最短路径 \n1003\tEmergency (25)       \n1018\tPublic Bike Management (30)       \n1030\tTravel Plan (30)       \n1072\tGas Station (30)        \n1087\tAll Roads Lead to Rome (30)         \n1111\tOnline Map (30)     \n##### 10.5 最小生成树\n##### 10.6 拓扑排序\n##### 10.7 关键路径\n### 十一、动态规划\n##### 11.2 最大子序列和\n1007\tMaximum Subsequence Sum (25)           \n##### 11.3 最长不下降子序列（LIS）\n1045\tFavorite Color Stripe (30)     \n##### 11.4 最长公共子序列（LCS）\n1045\tFavorite Color Stripe (30)       \n##### 11.5 最长回文子串\n1040\tLongest Symmetric String (25)       \n##### 11.6 DAG最长路\n##### 11.7 背包问题\n1068\tFind More Coins (30)        \n### 十二、字符串专题\n##### 12.1 字符串hash     \n1040\tLongest Symmetric String (25)     \n##### 12.2 KMP算法\n### 十三、扩展\n##### 13.1 分块思想\n1057\tStack (30)      \n##### 13.2 树状数组\n1057\tStack (30)     \n##### 13.3 变态模拟\n1014\tWaiting in Line (30)        \n1017\tQueueing at Bank (25)        \n1026\tTable Tennis (30)    \n1105\tSpiral Matrix (25)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemonameless%2Fpat_advanced-and-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnemonameless%2Fpat_advanced-and-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemonameless%2Fpat_advanced-and-algorithm/lists"}