03 2022 档案

PAT(甲级)2019年秋季考试练习
摘要：1160 Forever (20 分) "Forever number" is a positive integer A with K digits, satisfying the following constrains: the sum of all the digits of A is m; 阅读全文
posted @ 2022-03-04 21:43 勇往直前的力量 阅读(81) 评论(0) 推荐(0)
PAT（甲级）2020年冬季考试练习
摘要：7-1 The Closest Fibonacci Number (20 分) The Fibonacci sequence Fn is defined by The closest Fibonacci number is defined as the Fibonacci number with t 阅读全文
posted @ 2022-03-04 21:24 勇往直前的力量 阅读(66) 评论(0) 推荐(0)
1133 Splitting A Linked List (25 分)（链表）
摘要：Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all 阅读全文
posted @ 2022-03-02 22:48 勇往直前的力量 阅读(40) 评论(0) 推荐(0)
【专题复习6：链表】1032、1052、1074、1097、1133
摘要：1032 1032 点击查看代码 #include <bits/stdc++.h> using namespace std; struct Node { char key; int next; bool flag; }node[100000]; int main() { #ifdef ONLINE_ 阅读全文
posted @ 2022-03-02 22:47 勇往直前的力量 阅读(389) 评论(0) 推荐(0)
【专题复习5：并查集】1107、1114、1118
摘要：1107 1107 i号同学：喜欢的活动1、喜欢的活动2... 1:5 6 course[5]=1 course[6]=1 2:5 union(2,findFather(course[5]))-> union(2,1) 2->1 3:5 union(3,findFather(course[5]))- 阅读全文
posted @ 2022-03-02 17:11 勇往直前的力量 阅读(84) 评论(0) 推荐(0)
1118 Birds in Forest (25 分)（并查集）
摘要：Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are 阅读全文
posted @ 2022-03-02 17:10 勇往直前的力量 阅读(36) 评论(0) 推荐(0)
1114 Family Property (25 分)（并查集）
摘要：This time, you are supposed to help us collect the data for family-owned property. Given each person's family members, and the estate（房产）info under hi 阅读全文
posted @ 2022-03-02 15:53 勇往直前的力量 阅读(66) 评论(0) 推荐(0)
【专题复习4：Dijkstra】1003、1018、1030、1072、1087、1111
摘要：1003 1003 点击查看代码 #include <bits/stdc++.h> using namespace std; const int INF=999999999; int n,m,c1,c2; int e[510][510],weight[510],w[510]; int d[510], 阅读全文
posted @ 2022-03-01 21:24 勇往直前的力量 阅读(278) 评论(0) 推荐(0)
1111 Online Map (30 分)（Dijkstra算法）
摘要：Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two paths to your user: one is t 阅读全文
posted @ 2022-03-01 21:13 勇往直前的力量 阅读(65) 评论(0) 推荐(0)