![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法题
kukubao207
stay hungry,stay foolish
展开
-
PAT_1044. Shopping in Mars
//// main.cpp// PAT_1044. Shopping in Mars//// Created by wjq on 17/5/9.// Copyright © 2017年 wjq. All rights reserved.//#include #include using namespace std;int N,M,A[100000005],hasEqu原创 2017-05-09 20:12:28 · 153 阅读 · 0 评论 -
PAT_1061. Dating
//// main.cpp// PAT_1061. Dating//// Created by wjq on 17/5/18.// Copyright © 2017年 wjq. All rights reserved.//#include using namespace std;string A,B,C,D;string week[7]={"MON","TUE","W原创 2017-05-18 16:13:21 · 204 阅读 · 0 评论 -
PAT_1045. Favorite Color Stripe
//// main.cpp// PAT_1045. Favorite Color Stripe//// Created by wjq on 17/5/9.// Copyright © 2017年 wjq. All rights reserved.//#include using namespace std;int x[205],y[10005],c[205][10005原创 2017-05-09 21:11:01 · 192 阅读 · 0 评论 -
PAT_1046. Shortest Distance
//// main.cpp// PAT_1046. Shortest Distance//// Created by wjq on 17/5/9.// Copyright © 2017年 wjq. All rights reserved.//#include #include using namespace std;int N,M,D[100005],sum=0,d,原创 2017-05-09 23:03:51 · 172 阅读 · 0 评论 -
PAT_1062. Talent and Virtue
//// main.cpp// PAT_1062. Talent and Virtue//// Created by wjq on 17/5/18.// Copyright © 2017年 wjq. All rights reserved.//#include #include using namespace std;struct person{ int原创 2017-05-18 16:53:27 · 189 阅读 · 0 评论 -
PAT_1068. Find More Coins
#include #include #include using namespace std;int M,N,a[10005],vis[10005],co=0;bool hasFind = false;void dfs(int sum,int start){ if(sum==M) { hasFind=true; for(int i=0;i<N;i++) if(vis原创 2017-08-16 11:29:00 · 240 阅读 · 2 评论 -
PAT_1069. The Black Hole of Numbers
#include #include #include using namespace std;int N,num[4];int cmp(int a,int b){ return a>b;}bool PrepareAndJudge(){ memset(num,0,sizeof(num)); int j=0,temp=N; while(temp!=0) { num[j]原创 2017-08-16 17:17:10 · 127 阅读 · 0 评论 -
PAT_1070. Mooncake
#include #include using namespace std;int N;double D;struct Mooncake{ double weight,price,oneWP;}mooncake[1005];int cmp(Mooncake a,Mooncake b){ return a.oneWP>b.oneWP;}int main(){ scanf原创 2017-08-17 09:16:23 · 146 阅读 · 0 评论 -
PAT_1071. Speech Patterns
#include #include #include #include using namespace std;char s[1050000];string ans[1050000],temp;int tot=0;int main(){ gets(s); //预处理 for(int i=0;i<1050000;i++) if(s[i]>='A'&&s[i]<='Z')原创 2017-08-17 10:48:50 · 128 阅读 · 0 评论 -
PAT_1073. Scientific Notation
//// main.cpp// PAT_1073. Scientific Notation//// Created by wjq on 17/8/19.// Copyright © 2017年 wjq. All rights reserved.//#include #include using namespace std;string str;int E;int原创 2017-08-19 17:07:40 · 227 阅读 · 0 评论 -
PAT_1060. Are They Equal
//// main.cpp// PAT_1060. Are They Equal//// Created by wjq on 17/5/16.// Copyright © 2017年 wjq. All rights reserved.// #include #include using namespace std;int N;string a,b;int getr原创 2017-05-16 22:14:29 · 174 阅读 · 0 评论 -
PAT_1012. The Best Rank
//// main.cpp// PAT_1012. The Best Rank//// Created by wjq on 17/4/1.// Copyright © 2017年 wjq. All rights reserved.//#include #include #include #include using namespace原创 2017-04-02 18:31:51 · 164 阅读 · 0 评论 -
PAT_1004. Counting Leaves
//// main.cpp// PAT_1004. Counting Leaves//// Created by wjq on 17/3/30.// Copyright © 2017年 wjq. All rights reserved.//#include using namespacestd;int Tree[105][105];boo原创 2017-03-30 16:24:44 · 223 阅读 · 0 评论 -
PAT_1003. Emergency
//// main.cpp// PAT_1003. Emergency//// Created by wjq on 17/3/29.// Copyright © 2017年 wjq. All rights reserved.//SPFA#include #include #include using namespacestd;原创 2017-03-30 16:02:01 · 206 阅读 · 0 评论 -
PAT_1005. Spell It Right
//// main.cpp// PAT_1005. Spell It Right//// Created by wjq on 17/3/30.// Copyright © 2017年 wjq. All rights reserved.//#include using namespacestd;#include char p[10][6]=原创 2017-03-30 16:33:00 · 222 阅读 · 0 评论 -
PAT_1006. Sign In and Sign Out
//// main.cpp// PAT_1006. Sign In and Sign Out//// Created by wjq on 17/3/30.// Copyright © 2017年 wjq. All rights reserved.//#include #include #include using namespacestd原创 2017-03-30 16:54:01 · 228 阅读 · 0 评论 -
PAT_1007. Maximum Subsequence Sum
//// main.cpp// PAT_1007. Maximum Subsequence Sum//// Created by wjq on 17/3/30.// Copyright © 2017年 wjq. All rights reserved.//#include using namespacestd;int main(){原创 2017-03-30 17:37:49 · 200 阅读 · 0 评论 -
PAT_1008. Elevator
//// main.cpp// PAT_1008. Elevator//// Created by wjq on 17/3/30.// Copyright © 2017年 wjq. All rights reserved.//#include using namespacestd;int main(int argc,const char原创 2017-03-30 19:31:04 · 170 阅读 · 0 评论 -
PAT_1009. Product of Polynomials
//// main.cpp// PAT_1009. Product of Polynomials//// Created by wjq on 17/3/30.// Copyright © 2017年 wjq. All rights reserved.//#include #include #include using namespaces原创 2017-03-30 20:09:23 · 203 阅读 · 0 评论 -
PAT_1010. Radix
//// main.cpp// PAT_1010. Radix//// Created by wjq on 17/3/30.// Copyright © 2017年 wjq. All rights reserved.//// N1 N2 tag radix#include #include #define MIN(a,b) (a)using na原创 2017-03-31 10:39:13 · 156 阅读 · 0 评论 -
PAT_1011. World Cup Betting
//// main.cpp// PAT_1011. World Cup Betting//// Created by wjq on 17/3/31.// Copyright © 2017年 wjq. All rights reserved.//#include #include #include using namespacestd;原创 2017-03-31 11:59:40 · 157 阅读 · 0 评论 -
PAT_1063. Set Similarity(1个case超时)
求集合的交集和并集原创 2017-05-18 18:09:11 · 269 阅读 · 0 评论 -
PAT_1074. Reversing Linked List
//// main.cpp// PAT_1074. Reversing Linked List//// Created by wjq on 17/8/19.// Copyright © 2017年 wjq. All rights reserved.//#include using namespace std;int start,N,K;int linklist[10原创 2017-08-20 10:19:40 · 181 阅读 · 0 评论 -
PAT_1082. Read Number in Chinese
#include using namespace std;int number[9];char a[10][5]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};char b[8][5]={"Yi","Qian","Bai","Shi","Wan","Qian","Bai","Shi"};void Print(int n,原创 2017-08-22 16:05:00 · 172 阅读 · 0 评论 -
PAT_1083. List Grades
#include #include #include using namespace std;struct Student{ char name[15],id[15]; int grade;}stu[100005];vector v;int cmp(Student a,Student b){ return a.grade>b.grade;}int main(){ i原创 2017-08-22 16:50:12 · 158 阅读 · 0 评论 -
PAT_1084. Broken Keyboard
#include #include #include using namespace std;char A[100],B[100];//a-z对应[0,25] A-Z对应[26,51] 0-9对应[52,61] _对应62bool a[70],b[70];map m;int FindPos(char c){ if(c>='a'&&c<='z') return c-'a';原创 2017-08-22 17:16:20 · 158 阅读 · 0 评论 -
PAT_1067. Sort with Swap(0,*)
#include using namespace std;int a[100005],position[100005],N,inPositionNum=0,count=0,SwapTo=0;int FindFirst(int begin){ for(int i=begin;i<N;i++) if(a[i]!=i) return i; return -1;}int main原创 2017-08-15 16:49:18 · 160 阅读 · 0 评论 -
PAT_1087. All Roads Lead to Rome
#include #include #include #include #include #include using namespace std;struct City{ string name; int happiness;}city[205]; //数字与城市的映射map m; //城市名字与数字的映射int N,K,idx=1; int G[205][205原创 2017-08-25 15:00:48 · 342 阅读 · 0 评论 -
PAT_1085. Perfect Sequence
#include #include using namespace std;long long int a[100005],b[100005];int N,p;int binarySearch(int left,long long int m){ int mid,right=N-1; while(left<=right) { mid=(left+right)/2; if(原创 2017-08-23 10:31:16 · 148 阅读 · 0 评论 -
PAT_1086. Tree Traversals Again
#include #include using namespace std;char str[10];int number,index=0,N;struct Node{ int val; Node *left; Node *right; Node(int v) { val=v; left=NULL; right=NULL; }};int idx=0;Nod原创 2017-08-23 15:37:37 · 181 阅读 · 0 评论 -
PAT_1088. Rational Arithmetic
#include using namespace std;long long int gcd(long long int m,long long int n){ if(n==0) return m; else return gcd(n,m%n);}void outputStandard(long long int a,long long int b){ bool isNe原创 2017-08-25 16:07:45 · 195 阅读 · 0 评论 -
PAT_1090. Highest Price in Supply Chain
#include #include #include using namespace std;int N,maxDepth=0,num=0;double P,r;struct Node{ int father,depth;}node[100005];bool isYezi[100005];int Find(int v){ int depth=0; int x=v;原创 2017-08-31 17:29:49 · 236 阅读 · 0 评论 -
PAT_1064. Complete Binary Search Tree
#include #include using namespace std;int tree[1005],num[1005],N;static int index=0;//中序遍历void InorderTraversal(int node){ if(node>N) return; InorderTraversal(2*node); tree[node]=num[index原创 2017-08-15 15:27:27 · 138 阅读 · 0 评论 -
PAT_1065. A+B and C
#include using namespace std;long long int a,b,c,res,test;int main(){ //test = ((long long)1 )<<63; //printf("2^63=%lld\n",test); int M; bool flag; scanf("%d",&M); for(int i=1;i<=M;i++) {原创 2017-08-14 11:48:19 · 121 阅读 · 0 评论 -
PAT_1075. PAT Judge
//// main.cpp// PAT_1075. PAT Judge//// Created by wjq on 17/8/20.// Copyright © 2017年 wjq. All rights reserved.//#include #include #include using namespace std;map m;int score[10],su原创 2017-08-20 11:28:32 · 201 阅读 · 0 评论 -
PAT_1076. Forwards on Weibo
#include #include #include #include using namespace std;queue q;vector G[1005];bool vis[1005];int depth[1005];int bfs(int L,int start){ memset(vis,false,sizeof(vis)); while(!q.empty())原创 2017-08-21 11:57:21 · 159 阅读 · 0 评论 -
PAT_1077. Kuchiguse
#include #include using namespace std;char temp[105][260];string str[105],answer="";int main(){ int N,flag=1,resultL=0; scanf("%d",&N); gets(temp[0]); for(int i=0;i<N;i++) { gets(temp[i])原创 2017-08-21 14:39:46 · 169 阅读 · 0 评论 -
PAT_1078. Hashing
#include #include using namespace std;int prime[15000],p,temp,pos;bool flag[15000],isFilled[15000];int Msize,N,outputNum=0;int SolvePrime(int m){ memset(isFilled,false,sizeof(isFilled)); mems原创 2017-08-21 15:27:05 · 161 阅读 · 0 评论 -
PAT_1080. Graduate Admission
#include #include #include #include using namespace std;struct Student{ int id; int GE,GI; int choice[10]; int rank;}stu[40005];int N,M,K;int quota[105],nowQuota[105];vector school[105];原创 2017-08-21 17:31:22 · 288 阅读 · 0 评论 -
PAT_1081. Rational Sum(辗转相除法)
#include using namespace std;//辗转相除法,求a和b的最大公约数long long int gcd(int a,int b){ if(b==0) return a; else return gcd(b,a%b);}int main(){ int N; long long int a1=0,b1=1,a2,b2,maxGys; scanf原创 2017-08-22 10:14:48 · 191 阅读 · 0 评论