#include <stdio.h>#include <string.h>#include <stdlib.h>#include <memory.h>#include <stddef.h>typedef unsigned char BYTE;typedef unsigned long long WORD;typedef ...
2019-06-28 17:35:49
518
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <time.h>int pc1[57]={-1,57,49,41,33,25,17,9,1, 58,50,42,34,26,18,10,2, 59,51,43,35,27,19,11,3, 60,52,4...
2019-06-25 11:28:19
481
codeforce 888C K-Dominant Character
2017-12-09 22:30:57
346
51nod_1042 数字0-9的数量
2017-11-02 17:25:06
299
51nod_1489 蜥蜴和地下室
2017-11-01 19:31:14
567
zoj3985分类模拟
2017-11-01 01:48:30
281
zoj3983分类if模拟
2017-10-31 15:09:19
350
恶心贪心模拟“玲珑杯”ACM比赛 Round #22 - 这个E大概是垃圾桶捡来的_1171
2017-10-30 18:20:13
304
cf_878B Teams Formation 思维下模拟
2017-10-28 16:10:32
334
1631 小鲨鱼在51nod小学线段树
2017-10-28 02:04:10
233
51nod_1640 天气晴朗的魔法恶心规律模拟题
2017-10-25 16:53:34
273
debug-877E Danil and a Part-time Job
2017-10-24 19:43:49
235
模拟-debug
2017-10-20 02:06:41
240
递推/dp
2017-10-15 13:59:15
238
数学,,思考一点点,实现一点点,进步一点点,
2017-10-15 00:05:14
282
代码实现能力好搓..
2017-10-12 16:38:55
271
状压dp,三进制,tsp
2017-10-10 14:21:55
502
构造
2017-10-10 13:52:58
380
dfs
2017-10-10 13:49:11
252
状压dp
2017-10-09 09:23:24
317
状态压缩dp,tsp
2017-10-08 20:53:25
226
hdu 2089
2017-10-06 23:54:39
231
ACdream 1732
2017-10-01 17:41:21
1194
二分cf Robin Hood CodeForces - 672D
2017-09-07 17:09:11
306
nyoj 547poj 2227
2017-08-07 20:34:13
237
poj2823
2017-08-07 19:53:24
466
http://acm.xidian.edu.cn/problem.php?id=1045学习了。
2017-08-05 22:52:27
723
poj1273
2017-08-04 23:15:57
220
hdu1596
2017-08-04 18:36:57
233
LightOJ - 1282 对数学不敏感的搬运工
2017-07-30 11:05:52
282
UVA - 10815
2017-07-28 19:51:50
249
poj1185代码的搬砖工
2017-07-27 20:53:28
251
hdu4403
2017-07-26 19:54:02
477
hdu 5692
2017-07-24 09:22:07
226
poj1151代码的搬运工,扫描线
2017-07-22 10:17:33
290
2002: [Hnoi2010]Bounce 弹飞绵羊
2017-07-22 09:04:38
318
hdu5057
2017-07-21 22:10:00
258
#include //char打表,测试没问题,,但会超内存,测试中至少有30步的。#include#include#include#include#include#include#include#includeusing namespace std;typedef long long LL;const int N=1e6;int _a[5][5];int a[15]={
2017-07-06 17:00:11
368
#includeusing namespace std;int book[50][50];int book1[50];char c[50][50];char str[2000];int main(){ int cn=1; while(scanf("%s",str+1)!=EOF) { memset(book,0,sizeof(book));
2017-04-19 11:59:33
271
#include//#include#include#include#includeusing namespace std;char str[15][70];int main(){ int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n);
2017-04-19 11:39:33
229