ACSeed

2015年7月31日

http://www.patest.cn/contests/pat-a-practise/1039#include#include#include#includeusing namespace std;int n, k;char str[20];int myhash(char *s) { re... Read More

posted @ 2015-07-31 09:59 ACSeed Views(152) Comments(0) Diggs(0)

2015年7月30日

PAT 1013. Battle Over Cities (25)

http://www.patest.cn/contests/pat-a-practise/1013n个节点形成一棵树需n-1条边，减去已有的边数就是需要重新修建的#include#include#include#define MAXN 1100*1100int p[MAXN];int u[MAXN... Read More

posted @ 2015-07-30 21:50 ACSeed Views(180) Comments(0) Diggs(0)

PAT 1012. The Best Rank (25)

http://www.patest.cn/contests/pat-a-practise/1012这题比较坑啊，没说明白如果成绩相同怎么排序，例如 1 2 2 3 那3是排第三还是排第四？两个2怎么排，两个第二，没有第三， 3排第四 1 #include 2 #include 3 #inc... Read More

posted @ 2015-07-30 09:20 ACSeed Views(169) Comments(0) Diggs(0)

2015年7月29日

PAT 1011. World Cup Betting (20)

http://www.patest.cn/contests/pat-a-practise/1011 1 #include 2 #include 3 4 const int eps = 1e-9; 5 6 char bet[] = {'W', 'T', 'L'}; 7 double odds[3]... Read More

posted @ 2015-07-29 22:40 ACSeed Views(342) Comments(0) Diggs(0)

PAT 1079. Total Sales of Supply Chain (25)

http://www.patest.cn/contests/pat-a-practise/1079和1090一样的 1 #include 2 #include 3 #include 4 #include 5 6 #define MAXN 100010 7 #define MAX(A, B) ((A... Read More

posted @ 2015-07-29 17:45 ACSeed Views(191) Comments(0) Diggs(0)

PAT 1090. Highest Price in Supply Chain (25)

http://www.patest.cn/contests/pat-a-practise/1090 1 #include 2 #include 3 #include 4 #include 5 6 #define MAXN 100010 7 #define MAX(A, B) ((A) > (B) ... Read More

posted @ 2015-07-29 16:19 ACSeed Views(179) Comments(0) Diggs(0)

PAT 1010. Radix (25)

http://www.patest.cn/contests/pat-a-practise/1010以为要写大数呢，改成 long long 就过了，嚓 1 #include 2 #include 3 4 #define MAX(A, B) ((A) > (B) ? (A) : (B)) 5 6... Read More

posted @ 2015-07-29 15:16 ACSeed Views(245) Comments(0) Diggs(0)

PAT 1008. Elevator (20)

http://www.patest.cn/contests/pat-a-practise/1008水 1 #include 2 #include 3 4 #define MAXN 10000 5 int n; 6 int a[MAXN]; 7 8 int main() { 9 freop... Read More

posted @ 2015-07-29 13:13 ACSeed Views(183) Comments(0) Diggs(0)

PAT 1007. Maximum Subsequence Sum (25)

http://www.patest.cn/contests/pat-a-practise/1007经典的最大子序列和样例太具有迷惑性了，我以为输出的数组下标，结果一直不过，原来是输出的子序列最后一个数和第一个数，样例中数组下标和子序列中的数是一样的//O(n) 1 #include 2 #i... Read More

posted @ 2015-07-29 10:57 ACSeed Views(228) Comments(0) Diggs(0)

PAT 1006. Sign In and Sign Out (25)

地址：　http://www.patest.cn/contests/pat-a-practise/1006 1 #include 2 #include 3 #include 4 5 #define MAXN 20 6 char first_id[MAXN]; 7 char last_id[MAXN... Read More

posted @ 2015-07-29 09:05 ACSeed Views(167) Comments(0) Diggs(0)

公告