2012年12月15日
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< Read More
posted @ 2012-12-15 15:36 Frank@609 Views(437) Comments(0) Diggs(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 Read More
posted @ 2012-12-15 15:19 Frank@609 Views(303) Comments(0) Diggs(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 Read More
posted @ 2012-12-15 10:38 Frank@609 Views(222) Comments(0) Diggs(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 Read More
posted @ 2012-12-15 10:09 Frank@609 Views(160) Comments(0) Diggs(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 Read More
posted @ 2012-12-15 09:34 Frank@609 Views(232) Comments(0) Diggs(0)
2012年12月14日
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' Read More
posted @ 2012-12-14 16:59 Frank@609 Views(213) Comments(0) Diggs(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 Read More
posted @ 2012-12-14 16:31 Frank@609 Views(1291) Comments(0) Diggs(0)
2012年12月11日
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 Read More
posted @ 2012-12-11 18:23 Frank@609 Views(846) Comments(0) Diggs(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 Read More
posted @ 2012-12-11 18:22 Frank@609 Views(332) Comments(0) Diggs(0)
2012年12月10日
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, Read More
posted @ 2012-12-10 16:39 Frank@609 Views(484) Comments(0) Diggs(0)