![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PAT甲级
ShadowFox_
这个作者很懒,什么都没留下…
展开
-
PAT-A 1003 Emergency (25)
#include <iostream>#include <iomanip>using namespace std;#define MAXN 501#define INFINITE 99999999struct Graph{ int vexnum;//顶点数 int edge;//边数 int vexdata[MAXN]; ...原创 2018-08-04 14:33:31 · 108 阅读 · 0 评论 -
PAT-A 1137 Final Grading(25 分)
#include <iostream>#include <map>#include <string>#include <algorithm>#include <cstdio>#include <vector>#include <cmath>using namespace std;struct m原创 2018-08-22 20:07:44 · 263 阅读 · 0 评论 -
PAT-A 1138 Postorder Traversal(25 分)
#include <iostream>#include <cstdio>using namespace std;#define MAXN 50001int pre[MAXN];int in[MAXN];int flag=0;struct node{ int value; node *left; node *right;};v...原创 2018-08-22 20:08:29 · 201 阅读 · 0 评论 -
PAT-A 1139 First Contact(30 分)
#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <vector>#include <cstdio>#include <map>#include <set>原创 2018-08-22 20:09:37 · 360 阅读 · 0 评论 -
PAT-A 1147 Heaps(30 分)
#include <iostream>#include <cstdio>using namespace std;#define MAXN 1026int isempty=0;void postorder(int n,int heap[],int head){ if(head<n){ postorder(n,heap,head*...原创 2018-08-20 20:41:58 · 217 阅读 · 0 评论 -
PAT-A 1146 Topological Order(25 分)
#include <iostream>#include <cstdio>#include <cstring>#include <vector>using namespace std;#define MAXN 1001struct Edge{ int tail; Edge *next=NULL;};struct ...原创 2018-08-20 20:43:08 · 271 阅读 · 0 评论 -
PAT-A 1145 Hashing - Average Search Time(25 分)
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>using namespace std;#define MAXN 100001bool prime(int x){ /*if(x==2||x==3){ return tru...原创 2018-08-20 20:44:17 · 277 阅读 · 0 评论 -
PAT-A 1144 The Missing Number(20 分)
#include <iostream>#include <cstdio>#include <set>using namespace std;int main(){ set<int> a; int N; scanf("%d",&N); int t,p=1;; for(int i=1;i&l...原创 2018-08-20 20:45:39 · 176 阅读 · 0 评论 -
PAT-A 1140 Look-and-say Sequence(20 分)
#include <iostream>#include <vector>using namespace std;int main(){ int D,n; cin>>D>>n; vector<int> a,b; a.push_back(D); for(int i=1;i<n;i++)...原创 2018-08-21 20:57:31 · 295 阅读 · 0 评论 -
PAT-A 1141 PAT Ranking of Institutions(25 分)
#include <iostream>#include <map>#include <string>#include <cstring>#include <cstdio>#include <vector>#include <algorithm>using namespace std;#defi原创 2018-08-21 20:58:32 · 318 阅读 · 0 评论 -
PAT-A 1142 Maximal Clique(25 分)
#include <iostream>#include <set>#include <cstdio>#include <cstring>using namespace std;#define MAXN 201int a[MAXN][MAXN];bool isClique(int K,int t[]){ for(int i=...原创 2018-08-21 21:00:04 · 205 阅读 · 0 评论 -
PAT-A 1136 A Delayed Palindrome(20 分)
#include <iostream>#include <string>using namespace std;bool judge(string n){ int len=n.size(); for(int i=0;i<len/2;i++){ if(n[i]!=n[len-i-1]){ return ...原创 2018-08-22 20:06:56 · 225 阅读 · 0 评论 -
PAT-A 1013 Battle Over Cities (25)
#include <iostream>#include <cstdio>using namespace std;#define MAXN 1001//连通分量//n个连通分量需要n-1条路int city[MAXN];struct edge{ int head; int tail; //从1开始};int gethead...原创 2018-08-06 17:57:25 · 138 阅读 · 0 评论 -
PAT-A 1002 A+B for Polynomials (25)
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){ double a[1002]; memset(a,0,sizeof(a)); int s1,s2; cin>>s1; int...原创 2018-08-01 18:08:38 · 138 阅读 · 0 评论 -
PAT-A 1004 Counting Leaves (30)
#include <iostream>#include <vector>using namespace std;#define MAXN 102#define SONMAXN 10struct Node{ int father; int layer; vector<int> son;}node[MAXN];void D...原创 2018-08-04 17:08:54 · 149 阅读 · 0 评论 -
PAT-A 1005 Spell It Right (20)
#include <iostream>#include <cstdio>#include <stack>using namespace std;int main(){ char c; int sum=0; while(scanf("%c",&c)) { if(c=='\n') ...原创 2018-08-04 22:13:13 · 153 阅读 · 0 评论 -
PAT-A 1008 Elevator (20)
#include <stdio.h>#define MAX 1000int main(int argc, const char * argv[]){ int n; int a[MAX]; scanf("%d",&n); int i; int sum=5*(n); scanf("%d",&a[0]); su...原创 2018-08-04 23:34:48 · 157 阅读 · 0 评论 -
PAT-A 1007 Maximum Subsequence Sum (25)
#include <iostream>using namespace std;#define MAXN 10010int main(){ int num[MAXN]; int n,flag=0,flag0=0; cin>>n; int bg=0,ed=0,sum=0,maxsum=0,tb=0; for(int i=0;...原创 2018-08-04 23:28:18 · 101 阅读 · 0 评论 -
PAT-A 1006 Sign In and Sign Out (25)
#include <iostream>#include <algorithm>#include <string>#include <cstdio>using namespace std;#define MAXN 17struct Time{ string name; int begin; int end;}d...原创 2018-08-04 22:38:36 · 182 阅读 · 0 评论 -
PAT-A 1009 Product of Polynomials (25)
#include <iostream>#include <algorithm>#include <cstring>#include <iomanip>using namespace std;int main(){ int l1,l2; double s1[2002],s2[2002]; memset(s1,0...原创 2018-08-05 10:59:27 · 127 阅读 · 0 评论 -
PAT-A 1010 Radix (25)
#include <iostream>#include <string>#include <cmath>#define long long longusing namespace std;long change(string a,long radix){ long a0=0; long len=a.size(); fo...原创 2018-08-05 22:56:04 · 153 阅读 · 0 评论 -
PAT-A 1001 A+B Format (20)
#include <iostream>#include <cstdio>#include <vector>using namespace std;vector<int> res;int main(){ int a,b,c,flag=0; cin>>a>>b; c=a+b; if(...原创 2018-08-01 13:42:00 · 177 阅读 · 0 评论 -
PAT-A 1011 World Cup Betting (20)
#include <iostream>#include <iomanip>using namespace std;int maxlow(double a[]){ if(a[0]>=a[1]&&a[0]>=a[2]){ return 0; }else if(a[1]>=a[0]&&a[...原创 2018-08-06 12:26:10 · 167 阅读 · 0 评论 -
PAT-A 1012 The Best Rank (25)
#include <iostream>#include <algorithm>#include <string>using namespace std;#define MAXN 2005struct data{ int grade; string name;};bool cmp(const data &a,const...原创 2018-08-06 14:05:27 · 173 阅读 · 0 评论 -
PAT-A 1143 Lowest Common Ancestor(30 分)
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;#define MAXN 10005int pre[MAXN];int in[MAXN];struct G{ int value; G *left=NULL,*right=N...原创 2018-08-21 21:01:37 · 249 阅读 · 0 评论