- 博客(22)
- 收藏
- 关注
RSS订阅原创 平衡树模板
1.treap #include#include#include#include#include#include#includeusing namespace s
2016-08-14 15:38:36
259
原创 La2678
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)int read[MAXN], pre[MAXN];int main(){ int n, s; while(scanf("%d%d", &
2016-05-17 11:15:58
254
原创 uva 11549
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)struct tnode{ double ti; bool LR; bool operator <(const tnode &a)const
2016-05-17 11:14:41
236
原创 uva 11549
#include#include#include#include#include#include#include#includeusing namespace std;int n, k;set s;int next(int a){ stringstream ss; ss << (long long) k*k; string s = ss.str(); if(
2016-05-17 11:13:23
183
原创 uva 11078
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)int read[MAXN];int main(){ int T; scanf("%d", &T); while(T--){ int
2016-05-17 11:12:35
133
原创 uva 11462
#include#include#include#include#include#includeusing namespace std;#define MAXA (100+5)int age[MAXA];void init(){ memset(age, 0, sizeof(age));}int main(){ int n; while(scanf("%d",
2016-05-17 11:11:01
148
原创 La 3177
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)int n;int r[MAXN];int r1[MAXN], r2[MAXN];bool check(int num_p){ i
2016-05-17 11:09:49
206
原创 LA 3902
#include#include#include#include#include#include#includeusing namespace std;#define MAXN (1000+5)int n, s, k;vector con[MAXN], nodes[MAXN];int f[MAXN];bool cover[MAXN];void init(){ f
2016-05-17 11:08:18
257
原创 uva 11520
#include#include#include#include#include#includeusing namespace std;#define MAXN (10+5)char read[MAXN][MAXN];int main(){ int T; scanf("%d", &T); int t = 0; while(T--){ int n;
2016-05-17 11:07:31
153
原创 La 3635
#include#include#include#include#include#includeusing namespace std;#define MAXN (10000+5)const double PIE = acos(-1.0);int n, f;double s[MAXN];bool check(double now){ int sum = 0; fo
2016-05-17 11:06:41
324
原创 La 3971
#include#include#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (1000+5)#define MAXC (20+5)struct node{ int id, gd, pr;};int n
2016-05-17 11:05:32
355
原创 uva 10795
#include#include#include#include#include#includeusing namespace std;#define MAXN (60+5)int start[MAXN], final[MAXN];long long dfs(int* begin, int now, int n_z){ if(!now) return 0; if(be
2016-05-17 11:04:33
179
原创 uva 11384
#include#include#include#include#include#includeusing namespace std;int dfs(int n){ return n == 1? 1: dfs(n/2)+1;}int main(){ int n; while(scanf("%d", &n) != EOF) printf("%d\n", dfs(n)
2016-05-17 11:03:29
208
原创 11210
#include#include#include#include#include#includeusing namespace std;const char* mahjong[]={ "1T","2T","3T","4T","5T","6T","7T","8T","9T", "1S","2S","3S","4S","5S","6S","7S","8S","9S",
2016-05-17 11:02:34
168
原创 La 3401
#include#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (4+5)#define MAXR (24+5)vector names;int dic[24][6] = {{2,1,5,0,4,3}, {2,
2016-05-17 11:00:50
337
原创 uva 11464
#include#include#include#include#include#includeusing namespace std;#define MAXN (15+5)#define INF 0x7f7f7f7fint n, tot;int fx[4][2] = {{-1,0}, {0,-1}, {1,0}, {0,1}};int read[MAXN][MAXN]
2016-05-17 10:58:44
173
原创 LA 2995
#include#include#include#include#include#includeusing namespace std;#define RED(i,n) for(int i = 0; i (n); i++)#define MAXN (10+5)int n;char view[6][MAXN][MAXN], pos[MAXN][MAXN][MAXN];
2016-05-17 10:56:31
238
原创 uva 10881
#include#include#include#include#include#includeusing namespace std;#define MAXN (10000+5)struct node{ int num; int wz; char cx; bool operator<(const node a)const{ return wz < a.wz;
2016-05-17 10:53:25
177
原创 uva 1388
uva 1388#include#include#include#include#include#includeusing namespace std;#define MAXN (1000000+5)long long per_g[MAXN], give[MAXN];int main(){ int n; while(scanf("%d", &
2016-05-17 10:52:00
131
原创 uva 11300
uva 11300#include#include#include#include#include#includeusing namespace std;#define MAXN (1000000+5)long long per_g[MAXN], give[MAXN];int main(){ int n; while(scanf("%d", &n)
2016-05-17 10:48:49
231
原创 uva11729
uva 11729任务执行时间长的先交代#include#include#include#include#include#includeusing namespace std;#define MAXN (1000+5)struct node{ int b, j; bool operator <(const node &a)const{
2016-05-17 10:45:46
209
原创 uva 11292
uva 11292简单的贪心#include#include#include#include#include#includeusing namespace std;#define MAXNM (20000+5)int dra[MAXNM], per[MAXNM];int main(){ int n, m; while(
2016-05-17 10:40:19
182
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人