推理
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
zoj 月赛
141 - ZOJ Monthly, July 2015 - H Twelves Monkeys Time Limit: 5 Seconds Memory Limit: 32768 KB James Cole is a convicted criminal living beneath a post-apocalyptic Philadelphia. Many year原创 2015-07-26 22:11:22 · 1315 阅读 · 0 评论 -
2015多校VI hdu
Cake Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 0 Accepted Submission(s): 0 Special Judge Problem Description There are m原创 2015-08-06 18:58:37 · 690 阅读 · 3 评论 -
Bestcoders 57 1002
Conturbatio Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 278 Accepted Submission(s): 126 Problem Description There are many r原创 2015-09-27 10:36:29 · 532 阅读 · 0 评论 -
uva11077
点击打开题目链接 题解: 动态规划,首先我们要掌握动态规划的过程,在递推环节中,对某个节点进行全面的分类讨论,确定递推关系式,然后确定初始条件。 #include #include #define N 30 unsigned long long d[N][N]; int n, k; void pre_do() { memset(d, 0, sizeof d);原创 2015-09-27 10:27:11 · 615 阅读 · 0 评论 -
弱校(国庆) Rectangle
E. Rectangle Time Limit: 1000ms Memory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status frog has a piece of paper divided into n rows and m原创 2015-10-01 15:14:50 · 419 阅读 · 0 评论 -
国庆弱校 Carries
B. Carries Time Limit: 1000ms Memory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status frog has n integers a1,a2,…,an, and she wants to add原创 2015-10-01 16:38:11 · 581 阅读 · 0 评论 -
2012-2013 ACM-ICPC, NEERC, Moscow Subregional Contest
C. #include #include #include using namespace std; #define LL long long #define N 1000 + 10 double a[N]; int n; int main() { while(~scanf("%d", &n)) { double sum = 0; f原创 2015-10-04 18:06:54 · 1095 阅读 · 0 评论 -
NEERC 2014 took place in St. Petersburg, Barnaul, Tbilisi and Tashkent on December 6-7, 2014
A. #include #include #include #include using namespace std; int n, m; int main() { freopen("alter.in", "r", stdin); freopen("alter.out", "w", stdout); while(~scanf("%d%d", &n, &m)原创 2015-10-03 17:47:43 · 461 阅读 · 0 评论 -
日常训练赛(国庆)
A. #include #include #include #include using namespace std; int n; int main() { freopen("ate.in", "r", stdin); freopen("ate.out", "w", stdout); while(~scanf("%d", &n)) {原创 2015-10-06 16:56:13 · 308 阅读 · 0 评论 -
A very hard Aoshu problem
D - A very hard Aoshu problem Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4403 Description Aoshu is very popular among prima原创 2015-10-24 18:49:41 · 536 阅读 · 0 评论 -
Bestcoders 56 Clarke and problem
Clarke and problem Accepts: 169 Submissions: 372 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Clarke is a patie原创 2015-09-20 20:52:47 · 473 阅读 · 0 评论 -
2015 网络赛
Fractal 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 This is the logo of PKUACM 2016. More specifically, the logo is generated as follows: 1. Put four points A0(0,0), B0(0,1),原创 2015-09-20 19:53:32 · 442 阅读 · 0 评论 -
模拟赛
#include #include #include #include using namespace std; #define N 100000 + 10 #define LL long long const int mod = 365 * 24 * 3600; struct que { LL a, b; }; bool cmp(que t1, que t2) {原创 2015-10-25 19:59:09 · 412 阅读 · 0 评论 -
HDU 4810 Wall Painting
Wall Painting Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2048 Accepted Submission(s): 651 Problem Description Ms.Fang love原创 2015-10-10 16:31:14 · 427 阅读 · 0 评论 -
poj 2499
Binary Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6417 Accepted: 2950 Description Background Binary trees are a common data structure in comp原创 2015-10-11 23:29:45 · 345 阅读 · 0 评论 -
How Many Maos Does the Guanxi Worth
How Many Maos Does the Guanxi Worth Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 1186 Accepted Submission(s): 424 Problem Desc原创 2015-09-24 09:36:14 · 520 阅读 · 0 评论 -
多校 9
Arithmetic Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 0 Accepted Submission(s): 0 Problem Description A sequence b原创 2015-08-18 17:02:55 · 766 阅读 · 0 评论 -
codeforces 250 div2 A B C D
A. 模拟 #include using namespace std; #define LL long long #define INF 0x3f3f3f3f #define maxn 100 + 10 char s[4][maxn]; int len[4]; int main() { int t1, t2; int Min = INF, Max = -INF;原创 2015-08-16 16:53:11 · 996 阅读 · 0 评论 -
hdu 4647
Another Graph Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1691 Accepted Submission(s): 630 Problem Description Alice an原创 2015-07-24 15:06:39 · 692 阅读 · 0 评论 -
BC
The mook jong Accepts: 185 Submissions: 306 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description ZJiaQ want to become原创 2015-08-08 22:14:44 · 651 阅读 · 0 评论 -
HDU 1466 直线交点情况
的BestCoder(有米!) 计算直线的交点数 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8881 Accepted Submission(s): 4006 Problem Descr原创 2015-08-09 11:53:48 · 717 阅读 · 0 评论 -
codeforces
B - Inna and Nine Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description Inna loves digit 9 very much. That's why she asked Dima to wri原创 2015-08-09 17:15:19 · 1379 阅读 · 0 评论 -
hdu 多校
Painter Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 739 Accepted Submission(s): 343 Problem Description Mr. Hdu is an painte原创 2015-07-29 15:16:08 · 830 阅读 · 0 评论 -
Rabbit Party
G. Rabbit Party Time Limit: 5000ms Memory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 39423 Rabbit Party A rabbit Taro decided原创 2015-08-24 15:49:31 · 1066 阅读 · 0 评论 -
切了几道水题复习
1. poj 1088 #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define eps 1e-8 #define PI acos(-1.0) #define INF 0x3f3f3原创 2015-08-10 17:39:35 · 649 阅读 · 0 评论 -
多校 hdu
欢迎参加——每周六晚的BestCoder(有米!) Solve this interesting problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1571 Accepted Submissi原创 2015-07-29 16:25:17 · 906 阅读 · 1 评论 -
Buildings
Buildings Time Limit: 2000ms Memory Limit: 32768KB 64-bit integer IO format: %I64d Java class name: Main Submit Status PID: 26314 Have you ever heard the story of Blue.Mary原创 2015-08-25 18:47:32 · 162 阅读 · 0 评论 -
HDU 5365
Run Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 957 Accepted Submission(s): 413 Problem Description AFA is a girl who like r原创 2015-08-13 19:54:47 · 630 阅读 · 0 评论 -
HDU 多校 VIII 1008 clock
Clock Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 377 Accepted Submission(s): 200 Problem Description Give a time.(hh:mm:ss)原创 2015-08-13 22:49:58 · 644 阅读 · 0 评论 -
多校I 1001
OO’s Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 888 Accepted Submission(s): 335 Problem Description OO has got a原创 2015-07-22 15:28:12 · 1120 阅读 · 0 评论 -
cf 567 c
C. Geometric Progression time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarp loves geometric progressio原创 2015-08-15 16:19:19 · 1094 阅读 · 0 评论 -
codefoeces 567 D
D. One-Dimensional Battle Ships time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Alice and Bob love playing o原创 2015-08-15 23:22:36 · 805 阅读 · 0 评论 -
codeforces 570 c
#include #include #include using namespace std; #define N 300000 + 10 int n, m; char s[N]; int doit() { int res = 0; int cnt = 0; for(int i = 1; i <= n; i++) { if(s[i] =原创 2015-08-16 11:20:52 · 1016 阅读 · 0 评论 -
Bestcoders 51 div2 1001
Zball in Tina Town Accepts: 356 Submissions: 2463 Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description Tina Town is a原创 2015-08-15 23:24:57 · 809 阅读 · 0 评论 -
HDU4455
Substrings Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2581 Accepted Submission(s): 798 Problem Description XXX has an arra原创 2015-11-01 19:53:36 · 618 阅读 · 0 评论