![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PAT advance
momottyy
这个作者很懒,什么都没留下…
展开
-
PAT A1043 is it a binary search tree (25)
#include#include#includeusing namespace std;const int MAX=1010;int n;vector post,bstpree;int pre[MAX];struct node{ int num; node* lchild; node* rchild;};node* newnode(int x){ node* Node原创 2017-03-04 11:04:28 · 189 阅读 · 0 评论 -
PAT A1102 invert a binary tree (25)
#include#include#include#includeusing namespace std;bool notroot[12]={false};int n;vector level,in;struct node{int lchild,rchild;}node[12];int findroot(){int i;for(i=0;iif(原创 2017-03-01 16:34:51 · 134 阅读 · 0 评论 -
PAT A1079 tota sales of supply chain (25)
#include#include#include#includeusing namespace std;int n;double rootprice,rttsum=0,r;struct node{double price;//layer functionint layer;int num;vector receive;}node[100010];原创 2017-03-01 16:35:23 · 133 阅读 · 0 评论 -
PAT A1098 insertion or heap sort (25)
和A1089类似#include#include#includeusing namespace std;const int MAX=105;int n;int init[MAX],parts[MAX],nexts[MAX],sorted[MAX];int cmp(int a,int b){return a}int judge(){in原创 2017-03-02 22:18:15 · 164 阅读 · 0 评论 -
PAT A1071 speech patterns (25)
这题有几个关键单词不懂借助了词典。。lexicographically smallest字典顺序,因为map会按键从小到大自动排序所以遍历到第一个符合的输出并break即可alphanumerical character指属于[0-9,a-z,A-Z]中的字符non-alphanumerical就是上面之外的字符#include#include#include#原创 2017-02-26 00:56:13 · 252 阅读 · 0 评论 -
PAT A1054 the dominent color (20)
#include#include#includeusing namespace std;int main(){int m,n;map mp;scanf("%d%d",&m,&n);int i,j;int px,maxpx,maxnum=0;for(i=0;ifor(j=0;jscanf("%d",&px);if(mp.count(px)==0)原创 2017-02-25 23:27:05 · 196 阅读 · 0 评论 -
PAT A1022 digital library (30)
卧槽卧槽!这道题有一个坑点!输出一定要补全七位(%7d)不然最后两个测试通不过,因为输入0000000之类的,int型会忽略前面的0#include<cstdio>#include<map>#include<string>#include<set>#include<cstring>#include<algori...原创 2017-02-26 13:56:27 · 462 阅读 · 2 评论 -
PatA1016 phone bills (25)
#include#include#includeusing namespace std;struct rec{char name[22];int mm,dd,hh,min;char status[10];}rcd[1005];//int fee[24]={10,10,10,10,10,10,20,20,20,15,15,15,15,15,15,15,20,30,原创 2017-02-16 13:05:25 · 256 阅读 · 0 评论 -
PAT A1028 list sorting (25)
#include#include#includeusing namespace std;struct stdt{char id[8];char name[10];int grade;}stu[100010];int cmp1(stdt a,stdt b){return strcmp(a.id,b.id)}int cmp2(stdt a,stdt b)原创 2017-02-16 14:09:15 · 183 阅读 · 0 评论 -
PAT A1055 the world's richest(25)
从头到尾遍历 万幸没有超时。晴神书里的写法是有优化#include#include#includeusing namespace std;struct man{char name[10];int age;int worth;}men[100005];int cmp(man a,man b){if(a.worth!=b.worth) ret原创 2017-02-16 16:09:49 · 257 阅读 · 0 评论 -
PatA1025 pat ranking(25)
#include#include#includeusing namespace std;struct testee{char id[15];//13 digitsint scr;int locid;//location idint ttlrk;//totalrankint lclrk;//finalrank}tstee[30010];bool cmp(t原创 2017-02-16 13:13:44 · 351 阅读 · 0 评论 -
PAT A1086 tree traversals again(25)
转为已知先序和中序求后序push的顺序是先序pop的顺序是后序#include#include#include#include#include#includeusing namespace std;vector in,pre,post;struct node{int data;node* lchild;node* rchild;};原创 2017-03-01 13:34:51 · 182 阅读 · 0 评论 -
PAT A1051 pop sequence
模拟入栈思想#include#include#include#includeusing namespace std;void check(vector sq,int m){int len=sq.size();int i,tag=0,j=0;stack st;for(i=1;iif(st.size()while((!st.empty())原创 2017-02-26 20:11:27 · 370 阅读 · 0 评论 -
PAT A1115 Counting Nodes in a BST (30)
#include#include#includeusing namespace std;int n;struct node{ int num; int layer; node* lchild; node* rchild;};node* newnode(int x){ node* newnode=new node; newnode->num=x; newnode->lch原创 2017-03-04 02:14:15 · 191 阅读 · 0 评论 -
PAT A1114 family property (25)
//用到并查集,有关系的人在一个圈子里,合并的时候注意根设为id较小的那个。遍历统计root和计房产数和面积,我单独开了一个数组放rootid#include#include#include#includeusing namespace std;int n;int father[10010];int isroot[10010];int familynum[10010]={0};原创 2017-03-04 01:26:30 · 313 阅读 · 0 评论 -
PAT A1113 integer set partition (25)
#include#include#includeusing namespace std;int n;vector sq;int getsum(int i,int j){ int sum=0; for(i;i<=j;i++){ sum+=sq[i]; } return sum;}int main(){ int i; scanf("%d",&n); int temp;原创 2017-03-03 23:57:28 · 193 阅读 · 0 评论 -
PAT A1119 pre- and post-order traversals(30)
这道题快把我弄晕了。。我讨厌各种序结合建树嘤嘤嘤。。。先序第一个肯定是根,第二个是左子树或者右子树的根pre[preL] -> 在后序序列找到该点划分左右子树,然后计算个数,递归。(看了一下别人的思路写的)#include#include#include#includeusing namespace std; int n;vector pre,post,in;bool unq=f原创 2017-03-03 22:10:05 · 370 阅读 · 0 评论 -
PAT A1118 birds in forest (25)
#include#include#include#includeusing namespace std;int n,k;const int MAX=10010;int father[MAX];int isroot[MAX]={0};set bird;void init(){ for(int i=0;i<MAX;i++){ father[i]=i; }}int fin原创 2017-03-03 19:20:02 · 154 阅读 · 0 评论 -
PAT A1116 come on!Let's C (20)
#include#include#include#includeusing namespace std;map ranklist;const int MAX=10010;bool hasfound[MAX]={0};vector query;vector result;int isprime(int n){ int len=sqrt(1.0*n); for(int i=2;原创 2017-03-03 14:11:25 · 307 阅读 · 0 评论 -
PAT A1122 hamiltonian cycle (25)
//哈密顿环路,能够沿边形成一个覆盖所有点的环路,中间点不重复。判断:1、k=n+1 2、数组首尾相同才能形成环路 3、每个点出现1次 4、必须有边才能走#include#include#includeusing namespace std;const int MAX=210;int G[MAX][MAX]={0};int judge(vector vn){ int vis[MAX原创 2017-03-03 12:45:08 · 274 阅读 · 0 评论 -
PAT A1120 friend numbers (20)
#include#include#include#include#includeusing namespace std;struct node{string number;int friendId;};vector num;int getfriend(string number){int len=number.size();int i,sum=0原创 2017-03-03 10:36:46 · 358 阅读 · 0 评论 -
PAT A1121 damn single (25)
#include#include#include#include#includeusing namespace std;vector lonely;vector guests;map couple;int hascome[100100]={0};int main(){int n,i,m;scanf("%d",&n);int id1,id2;f原创 2017-03-03 11:04:50 · 254 阅读 · 0 评论 -
PAT A1020 tree traversals (25)
#include#include#include#includeusing namespace std;vector post,in,level;int n;struct node{int data;node* lchild;node* rchild;};node* create(int postL,int postR,int inL,int inR原创 2017-03-01 00:27:59 · 352 阅读 · 0 评论 -
PAT A1089 insert or merge (25)
#include#include#includeusing namespace std;int n,num1[102],num2[102],sortnum[102];int getinsert(){int result=0;int i,j,k,tag=0,temp;for(i=1;itag=0;for(j=i;j>0;j--){//sortif(sort原创 2017-02-21 23:53:08 · 287 阅读 · 0 评论