12 2012 档案

PAT 1040. Longest Symmetric String
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;//回文有两种情况：aba或者abba，即有对称点和无对称点。int getSymLen(char *str,int pos){ int len = st 阅读全文
posted @ 2012-12-16 09:50 Frank@609 阅读(522) 评论(0) 推荐(0)
PAT 1041 Be Unique (20)
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;const int SIZE = 100000+5;int arrCount[SIZE];int main(){ int N,i,x; vector< 阅读全文
posted @ 2012-12-15 15:36 Frank@609 阅读(441) 评论(0) 推荐(0)
PAT 1038. Recover the Smallest Number
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;struct Node{ char strNum[10]; bool isUsed;};//获得字典序最小的数字,321,32这种情况要特殊考虑。stri 阅读全文
posted @ 2012-12-15 15:19 Frank@609 阅读(308) 评论(0) 推荐(0)
1037. Magic Coupon
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;bool greaterCmp(int a, int b){ return a>b;}int main(){ int NC,NP,i,j,x; ve 阅读全文
posted @ 2012-12-15 10:38 Frank@609 阅读(223) 评论(0) 推荐(0)
PAT 1035 Password
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;struct Account{ char chUser[15]; char chPass[15]; bool isModified;};bool modi 阅读全文
posted @ 2012-12-15 10:09 Frank@609 阅读(162) 评论(0) 推荐(0)
PAT 1036. Boys vs Girls
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;struct Student{ char chName[15]; char chId[15]; int iScore;};bool lessCmp(Stu 阅读全文
posted @ 2012-12-15 09:34 Frank@609 阅读(233) 评论(0) 推荐(0)
PAT 1027. Colors in Mars
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;vector<char> res(int t){ vector<char> v; char map[] = {'0' 阅读全文
posted @ 2012-12-14 16:59 Frank@609 阅读(216) 评论(0) 推荐(0)
PAT 1026 Table Tennis
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;const int MAX_N = 10000+5;const int MAX_TABLE = 100+5;const int OFF_TIME = 13 阅读全文
posted @ 2012-12-14 16:31 Frank@609 阅读(1294) 评论(0) 推荐(0)
PAT 1017. Queueing at Bank (25)
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;const int MAX_N = 10000+5;const int MAX_WIN = 100+5;const int OFF_TIME = 9*60 阅读全文
posted @ 2012-12-11 18:23 Frank@609 阅读(850) 评论(0) 推荐(0)
PAT 1028 List Sorting (25)
摘要：#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;struct Student{ char stu_id[15]; char strName[15]; int score;};Student arrStu 阅读全文
posted @ 2012-12-11 18:22 Frank@609 阅读(335) 评论(0) 推荐(0)
PAT 1025 PAT Ranking
摘要：#include<iostream>#include<string>#include<queue>#include<vector>#include<cmath>#include<iomanip>#include<algorithm>using namespace std;struct Student{ string stu_id; int finRank; int locNum; int locRank; int score;};bool greaterMark(const Student &stu1, 阅读全文
posted @ 2012-12-10 16:39 Frank@609 阅读(487) 评论(0) 推荐(0)
PAT 1014 Waiting in Line (30)
摘要：#include<iostream>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>using namespace std;//本题容易出错的地方：是在17:00及以后开始服务的客户输出"Sorry"，而不是17:00之前结束服务的输出"Sorry"；//如客户cId是16:59开始服务，服务时间为2，则输出的应该是17:01，而不是"Sorry"。co 阅读全文
posted @ 2012-12-10 11:31 Frank@609 阅读(1470) 评论(1) 推荐(0)
PAT 1009 Product of Polynomials
摘要：#include<iostream>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<iomanip>using namespace std;struct Node{ int exp; double coe;};vector<Node> vRes;//将两个多项式相加，最后的结果保存在v1中。//即将两个有序链表merge在一起。void addPols(vector<Node> &v1,vecto 阅读全文
posted @ 2012-12-01 20:40 Frank@609 阅读(802) 评论(0) 推荐(0)
PAT 1031. Hello World for U
摘要：#include<iostream>#include<cstring>#include<queue>using namespace std;int main(){ char str[100]; int len,n1,n2; cin>>str; len = strlen(str); //先求出n1和n2 if( (len-1)%2 == 0 ) { n1 = (len-1)/2; n2 = 3; } else { n1 = (len-2)/2; n2 = 4; } wh... 阅读全文
posted @ 2012-12-01 15:39 Frank@609 阅读(195) 评论(0) 推荐(0)
PAT 1020. Tree Traversals
摘要：#include<iostream>#include<cstring>#include<queue>using namespace std;//已知二叉树的后序和中序遍历，得到层次遍历顺序。const int N = 30;struct Node{ Node* left; Node* right; int data;};int postOrder[N];int inOrder[N];//b1,e1表示后序的开始和结束位置；b2,e2表示中序的开始和结束位置。void createTree(int b1,int e1,int b2,int e2,Node* & 阅读全文
posted @ 2012-12-01 14:45 Frank@609 阅读(351) 评论(0) 推荐(0)
PAT 1003 Emergency 深度优先搜索 （剪枝方案二，优化后）
摘要：#include<iostream>#include<cstring>using namespace std;const int N = 1000;const int INF = 100000000;//图的邻接矩阵int road[N][N];//标记某一节点是否被访问过bool isVisited[N];//记录每一节点的权值int team_num[N];int dis[N];//最短路径的数目int path_num =0;//最大的医疗队的数目int g_max_team_num = 0;void initData(){ int i,j; for(i=0; i 阅读全文
posted @ 2012-12-01 10:24 Frank@609 阅读(1406) 评论(0) 推荐(0)
PAT 1003 Emergency 深度优先搜索 （剪枝方案一，未优化）
摘要：#include<iostream>#include<cstring>using namespace std;const int N = 1000;const int INF = 100000000;//图的邻接矩阵int road[N][N];//标记某一节点是否被访问过bool isVisited[N];//记录每一节点的权值int team_num[N];int dis[N];//最短路径的数目int path_num =0;//最大的医疗队的数目int g_max_team_num = 0;void initData(){ int i,j; for(i=0; i 阅读全文
posted @ 2012-12-01 09:54 Frank@609 阅读(885) 评论(0) 推荐(0)