- 博客(108)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 九度1019 简单计算器
#include#include#include#include#include#include#include#include#include#include#include#define eps 1e-9#define ll long longusing namespace std;int op[300];int main(){ double x,y; s
2015-03-13 11:34:01
664
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 pat1063 Set Similarity
#include#include#include#include#include#include#include#include#define ll long longusing namespace std;sets[55];int main(){ int n,m,k,i,j,x,y; while(scanf("%d",&n)!=EOF) { for(i = 1;
2015-02-27 17:30:10
441
原创 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
原创 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
原创 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
412
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 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
原创 pat1091 Acute Stroke
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int n,m,l;bool a[70][1300][130],vis[70][1300][130];int dir[6][3] = {{0,0,1}
2015-02-26 19:18:51
360
原创 pat1090 Highest Price in Supply Chain
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int nm[100005];vectortree[100005];double ans,m,inc;int num;void dfs(int u
2015-02-26 17:39:40
362
原创 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
原创 pat1088 Rational Arithmeti
#include#include#include#include#include#include#define ll long longusing namespace std;struct node{ ll up,down;}a,b;ll gcd(ll x,ll y){ return y == 0?x:gcd(y,x%y);}node reduction(node
2015-02-26 15:29:09
432
原创 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
682
1
原创 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
原创 pat1039 Course List for Student
#include#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;const int mx = 26*26*26*10;vectorv[26*26*26*10];int main(){ int
2015-02-25 11:07:40
399
原创 pat1085 Perfect Sequence
#include#include#include#include#define ll long longusing namespace std;ll a[100005];int main(){ int n,m,i,j; while(scanf("%d%d",&n,&m)!=EOF) { for(i = 0;i<n;i++)scanf("%ll
2015-02-25 10:51:58
375
原创 pat1086 Tree Traversals Again
#include#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int rt;struct node{ int ls,rs; node() { ls = rs = 0; }}tree
2015-02-25 09:47:02
469
原创 pat1032 Sharing
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;struct node{ char key; int next;}p[1000005];int main(){ char c; int n
2015-02-24 23:57:32
491
原创 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
原创 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
原创 pat1019 General Palindromic Number
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int ans[50];int main(){ int n,base,i,j; while(scanf("%d%d",&n,&base)!=E
2015-02-24 19:13:09
384
原创 pat1023 Have Fun with Numbers
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;int l[300],h[300];string add(string a,string b){ int jin = 0; for(int i
2015-02-24 17:24:42
400
原创 pat1029 Median
#include#include#include#include#include#include#include#include#include#define ll long longusing namespace std;ll a[1000005],b[1000005],c[2000005];int main(){ int n,m,i,j,cnt; while(sc
2015-02-24 17:09:07
439
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人