PAT
关注
分享
扫一扫
王的守护者
大水逼
展开
-
pat1054 The Dominant Color
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;mapmp;int main(){ int n,m,i,j,x,mx,ans; while(scanf("%d%d",&n,&m)!=EOF原创 2015-02-24 12:00:09 · 392 阅读 · 0 评论 -
pat1028 List Sorting
#include#include#include#include#include#include#include#include#include#include#define N 10005#define ll long longusing namespace std;struct node{ char id[110],name[10]; int sc;}p[10原创 2015-02-27 14:34:45 · 367 阅读 · 0 评论 -
pat1070 Mooncake
#include#include#include#include#include#include#include#include#include#include#define N 1005#define ll long longusing namespace std;double num[N],pri[N];int s[N];const bool cmp(const原创 2015-02-27 19:34:04 · 401 阅读 · 0 评论 -
pat1038 Recover the Smallest Number
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;string a[10005];string ans;const bool cmp(const string &x,const string &y)原创 2015-02-26 20:12:20 · 356 阅读 · 0 评论 -
pat1036 Boys vs Girls
#include#include#include#include#include#include#include#include#include#include#define N 10005#define ll long longusing namespace std;vectorm,f;struct node{ string s1,s2;}p[105];int原创 2015-02-26 23:32:59 · 352 阅读 · 0 评论 -
pat1074
坑成狗，第一句说a singly linked list L,结果数据有不是一条链的#include#include#include#include#include#include#include#include#include#include#define N 100005#define ll long longusing namespace std;int dat原创 2015-02-27 20:30:35 · 460 阅读 · 0 评论 -
pat1075 PAT Judge
#include#include#include#include#include#include#define N 10005using namespace std;int sc[6],mp[100005];struct node{ int total,name,perf,f; int c[7]; node() { for(int i = 0;i<7;i++)c[i原创 2015-02-27 21:24:18 · 473 阅读 · 0 评论 -
pat1082 Read Number in Chinese
#include#include#include#include#include#include#include#include#define N 20005using namespace std;string nb[10] = {"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};string he[3] = {"原创 2015-02-28 00:10:02 · 595 阅读 · 0 评论 -
pat1015 Reversible Primes
#include#include#include#include#include#include#include#include#include#include#define N 10005#define ll long longusing namespace std;int ok(int x){ if(x == 1)return 0; for(int i = 2;原创 2015-02-27 10:09:40 · 314 阅读 · 0 评论 -
pat1013 Battle Over Cities
#include#include#include#include#include#include#include#include#include#include#define N 10005#define ll long longusing namespace std;vectore[1005];int vis[1005];int x;void dfs(int u)原创 2015-02-27 12:22:59 · 394 阅读 · 0 评论 -
pat1012 The Best Rank
#include#include#include#include#include#include#include#include#include#include#define N 10005#define ll long longusing namespace std;vector >s[4];pairans[2005];char ch[5] = "ACME";ma原创 2015-02-27 12:09:50 · 386 阅读 · 0 评论 -
pat1078 Hashing
背公式的题，毫无意义#include#include#include#include#include#include#define N 20005using namespace std;int h[N];int ok(int x){ if(x == 1)return 0; for(int i = 2;i*i<=x;i++) if(x%i == 0)return 0;原创 2015-02-27 22:51:21 · 516 阅读 · 0 评论 -
pat1067 Sort with Swap(0,*)
#include#include#include#include#include#include#include#include#include#include#define N 100005#define ll long longusing namespace std;vector >v;int a[N],pos[N],vis[N];int main(){ in原创 2015-02-27 18:01:46 · 426 阅读 · 0 评论 -
pat1027 Colors in Mars
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;char s[15] = "0123456789ABC";char ans[10];int main(){ int a,b,c; while(s原创 2015-02-24 16:28:25 · 363 阅读 · 0 评论 -
pat1017 Queueing at Bank
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;const double bg = 8*60*60;const double ed = 17*60*60;double ok[105];struct原创 2015-02-24 21:51:27 · 404 阅读 · 0 评论 -
pat1025 PAT Ranking
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;mapreg,rr;vector >v1,v2;const bool cmp(const pair p1,const pair p2){ if(p原创 2015-02-23 16:50:20 · 457 阅读 · 0 评论 -
pat1087 All Roads Lead to Rome
#include#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int bg,ed,cnt,total;int num,cost,sumh,minn;int id[205],happy[205],原创 2015-02-26 11:22:58 · 602 阅读 · 0 评论 -
pat1021 Deepest Root
#include#include#include#include#include#include#include#include#include#include#define N 10005#define ll long longusing namespace std;vectorv[N],ans[2],more;int max_d,num;int vis[N],in原创 2015-02-26 22:49:45 · 406 阅读 · 0 评论 -
pat1051 Pop Sequence
#include#include#include#include#include#include#include#include#include#include#define N 100005#define ll long longusing namespace std;int a[1005];stacks;int main(){ int n,m,k,i,j;原创 2015-02-27 15:27:25 · 458 阅读 · 0 评论 -
pat1062 Talent and Virtue
#include#include#include#include#include#include#include#include#include#include#define N 100005#define ll long longusing namespace std;struct node{ char id[10]; int s1,s2;}p[N];vect原创 2015-02-27 17:03:23 · 390 阅读 · 0 评论 -
pat1037 Magic Coupon
#include#include#include#include#include#include#include#include#include#include#define N 100005#define ll long longusing namespace std;int a[N],b[N];int main(){ int n,m,i,j; while(sc原创 2015-02-27 15:06:23 · 603 阅读 · 0 评论 -
pat 1051 Pop Sequence 解法2
#include#includeusing namespace std;int a[1005];int main(){ int n,m,k,i,j; while(scanf("%d%d%d",&m,&n,&k)!=EOF) { while(k--) { int min = 100000,max = -1,f = 1; for(i = 1;i<=n;i++)原创 2015-02-27 15:45:19 · 413 阅读 · 0 评论 -
pat1040 Longest Symmetric String
#include#include#include#include#include#include#include#include#include#include#define N 10005#define ll long longusing namespace std;int main(){ char s[1005]; cin.getline(s,1002,'\n'原创 2015-02-27 14:48:23 · 403 阅读 · 0 评论 -
pat1064 Complete Binary Search Tree
#include#include#include#include#define N 1005using namespace std;int a[N],data[N];int pos,n;queueq;void dfs(int u){ if(u*2<=n)dfs(2*u); data[u] = a[++pos]; if(u*2+1<=n)dfs(u*2+1);}int原创 2015-02-27 20:46:48 · 399 阅读 · 0 评论 -
PAT 1071 Speech Patterns
卡时间卡的比较紧#include#include#include#include#include#include#include#include#define ll long longusing namespace std;mapmp;int ok(char c){ if(c>='0'&&c<='9')return 1; if(c>='a'&&c<='z')retu原创 2014-08-31 17:51:45 · 432 阅读 · 0 评论 -
pat1024
#include#include#include#include#include#include#define ll long longusing namespace std;string add(string x,string y){ string c; int carry = 0; for(int i = 0;i<max(x.length(),y.length());i原创 2015-02-23 17:48:59 · 382 阅读 · 0 评论 -
pat1026 Table Tennis
1.当有多个乒乓球台空闲时，vip顾客到了会使用最小id的vip球台，而不是最小id的球台，测试以下用例：210:00:00 30 112:00:00 30 15 13输出正确结果应为：10:00:00 10:00:00 012:00:00 12:00:00 00 0 2 0 0 2.题目要求每对顾客玩的时间不超过2小时，那么当顾客要求玩的时间>2小时的时候，应该截原创 2015-02-26 14:34:16 · 683 阅读 · 1 评论 -
PAT 1018 Public Bike Management DFS+SPFA
被题目的意思搞跪了....从PBMC出发，到终点，路上把每个站点都调整到最优。路上如果后面有站点可以获得到多余的车，也不能把车带回来给前面的站点#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;que原创 2014-08-25 23:34:08 · 476 阅读 · 0 评论 -
pat1030 Travel Plan
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;queueq;int g1[505][505],g2[505][505],in[505],dis[505],pre[505],cost[505];in原创 2015-02-26 20:46:59 · 355 阅读 · 0 评论 -
pat1057 stack 分块的做法
#include#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int table[100005],bucket[1005];stackst;int n,m;int find(){ int原创 2015-03-07 15:17:39 · 540 阅读 · 0 评论 -
PAT 1014 Waiting in Line 模拟
#include#include#include#include#include#include#includeusing namespace std;int l[1005],ans[1005],tot[30];queueque[30];int main(){ int n,m,k,q,i,j,x; while(scanf("%d%d%d%d",&n,&m,&k,&q)!=原创 2014-08-25 11:51:39 · 451 阅读 · 0 评论 -
PAT 1072 Gas Station SPFA
//妈蛋，当时有个下标写错了...#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int n,m,k,d;int g[1100][1100],in[1100],dis[1100];int get(c原创 2014-08-25 11:48:43 · 629 阅读 · 0 评论 -
pat1089 Insert or Merge
#include#include#include#include#include#include#include#include#include#include#include#define eps 1e-9#define ll long longusing namespace std;int a[105],b[105],c[105];int n;int ok1()原创 2015-02-26 17:24:58 · 437 阅读 · 0 评论 -
pat1044 二分法
#include#include#include#include#include#define ll long longusing namespace std;int a[100005];int main(){ int n,m,i,j,x; while(scanf("%d%d",&n,&m)!=EOF) { int minmax = 1e9; for(i = 1;i原创 2015-03-04 16:30:33 · 503 阅读 · 0 评论 -
PAT1022 Digital Library 格式题...
以前的代码写的还真丑#include#include#include#include#include#include#include#include#define ll long longusing namespace std;map >mp[6];int c[6];int main(){ int n,m,i,j,id; string s; while(scan原创 2014-09-01 23:29:02 · 536 阅读 · 0 评论 -
PAT 1060 Are They Equal 暴力
#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int n;void get(string &s,int &exp){ int i; for(i = 0;i<s.length();i++)if(s[i] == '原创 2014-08-28 21:10:01 · 515 阅读 · 0 评论 -
pat1059 Prime Factors
#include#include#include#include#include#include#include#include#include#include#define N 100005#define ll long longusing namespace std;int ok[100000],prime[20000];int cnt = 0;vector >v原创 2015-02-27 16:09:30 · 440 阅读 · 0 评论 -
PAT1043 Is It a Binary Search Tree 水题
#include#include#include#include#include#include#include#include#include#define N 100005#define ll long long#define pb push_back#define eps 1e-9using namespace std;int cnt,ok;int a[N];原创 2014-08-31 17:24:24 · 450 阅读 · 0 评论 -
pat1003 Emergency
#include#include#include#include#include#include#include#include#include#define N 1005#define ll long long#define pb push_back#define eps 1e-9using namespace std;int head[N],c[N],in[N],d原创 2015-02-22 22:39:47 · 332 阅读 · 0 评论 -
pat1016 Phone Bills
#include#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int fee[25];mapmp;struct node{ string name; int tm,f;};vector原创 2015-02-24 23:33:53 · 400 阅读 · 0 评论