推理
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
zoj 月赛
141 - ZOJ Monthly, July 2015 - HTwelves MonkeysTime Limit: 5 Seconds Memory Limit: 32768 KBJames Cole is a convicted criminal living beneath a post-apocalyptic Philadelphia. Many year原创 2015-07-26 22:11:22 · 1320 阅读 · 0 评论 -
2015多校VI hdu
CakeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Special JudgeProblem DescriptionThere are m原创 2015-08-06 18:58:37 · 691 阅读 · 3 评论 -
Bestcoders 57 1002
ConturbatioTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 278 Accepted Submission(s): 126Problem DescriptionThere are many r原创 2015-09-27 10:36:29 · 533 阅读 · 0 评论 -
uva11077
点击打开题目链接题解: 动态规划,首先我们要掌握动态规划的过程,在递推环节中,对某个节点进行全面的分类讨论,确定递推关系式,然后确定初始条件。#include #include #define N 30unsigned long long d[N][N];int n, k;void pre_do(){ memset(d, 0, sizeof d);原创 2015-09-27 10:27:11 · 617 阅读 · 0 评论 -
弱校(国庆) Rectangle
E. RectangleTime Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Statusfrog has a piece of paper divided into n rows and m原创 2015-10-01 15:14:50 · 422 阅读 · 0 评论 -
国庆弱校 Carries
B. CarriesTime Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Statusfrog has n integers a1,a2,…,an, and she wants to add原创 2015-10-01 16:38:11 · 586 阅读 · 0 评论 -
2012-2013 ACM-ICPC, NEERC, Moscow Subregional Contest
C.#include #include #include using namespace std;#define LL long long#define N 1000 + 10double a[N];int n;int main(){ while(~scanf("%d", &n)) { double sum = 0; f原创 2015-10-04 18:06:54 · 1126 阅读 · 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 · 464 阅读 · 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 · 310 阅读 · 0 评论 -
A very hard Aoshu problem
D - A very hard Aoshu problemTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4403DescriptionAoshu is very popular among prima原创 2015-10-24 18:49:41 · 538 阅读 · 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 DescriptionClarke is a patie原创 2015-09-20 20:52:47 · 478 阅读 · 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 · 445 阅读 · 0 评论 -
模拟赛
#include #include #include #include using namespace std;#define N 100000 + 10#define LL long longconst int mod = 365 * 24 * 3600;struct que{ LL a, b;};bool cmp(que t1, que t2){原创 2015-10-25 19:59:09 · 413 阅读 · 0 评论 -
HDU 4810 Wall Painting
Wall PaintingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2048 Accepted Submission(s): 651Problem DescriptionMs.Fang love原创 2015-10-10 16:31:14 · 431 阅读 · 0 评论 -
poj 2499
Binary TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6417 Accepted: 2950DescriptionBackground Binary trees are a common data structure in comp原创 2015-10-11 23:29:45 · 348 阅读 · 0 评论 -
How Many Maos Does the Guanxi Worth
How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1186 Accepted Submission(s): 424Problem Desc原创 2015-09-24 09:36:14 · 523 阅读 · 0 评论 -
多校 9
Arithmetic SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionA sequence b原创 2015-08-18 17:02:55 · 767 阅读 · 0 评论 -
codeforces 250 div2 A B C D
A. 模拟#include using namespace std;#define LL long long#define INF 0x3f3f3f3f#define maxn 100 + 10char s[4][maxn];int len[4];int main(){ int t1, t2; int Min = INF, Max = -INF;原创 2015-08-16 16:53:11 · 998 阅读 · 0 评论 -
hdu 4647
Another Graph GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1691 Accepted Submission(s): 630Problem DescriptionAlice an原创 2015-07-24 15:06:39 · 694 阅读 · 0 评论 -
BC
The mook jong Accepts: 185 Submissions: 306 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionZJiaQ want to become原创 2015-08-08 22:14:44 · 654 阅读 · 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): 4006Problem Descr原创 2015-08-09 11:53:48 · 717 阅读 · 0 评论 -
codeforces
B - Inna and NineTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInna loves digit 9 very much. That's why she asked Dima to wri原创 2015-08-09 17:15:19 · 1385 阅读 · 0 评论 -
hdu 多校
PainterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 739 Accepted Submission(s): 343Problem DescriptionMr. Hdu is an painte原创 2015-07-29 15:16:08 · 832 阅读 · 0 评论 -
Rabbit Party
G. Rabbit PartyTime Limit: 5000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 39423Rabbit PartyA rabbit Taro decided原创 2015-08-24 15:49:31 · 1067 阅读 · 0 评论 -
切了几道水题复习
1. poj 1088#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define eps 1e-8#define PI acos(-1.0)#define INF 0x3f3f3原创 2015-08-10 17:39:35 · 653 阅读 · 0 评论 -
多校 hdu
欢迎参加——每周六晚的BestCoder(有米!)Solve this interesting problemTime 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 · 908 阅读 · 1 评论 -
Buildings
BuildingsTime Limit: 2000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 26314 Have you ever heard the story of Blue.Mary原创 2015-08-25 18:47:32 · 164 阅读 · 0 评论 -
HDU 5365
RunTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 957 Accepted Submission(s): 413Problem DescriptionAFA is a girl who like r原创 2015-08-13 19:54:47 · 632 阅读 · 0 评论 -
HDU 多校 VIII 1008 clock
ClockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 377 Accepted Submission(s): 200Problem DescriptionGive a time.(hh:mm:ss)原创 2015-08-13 22:49:58 · 646 阅读 · 0 评论 -
多校I 1001
OO’s SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 888 Accepted Submission(s): 335Problem DescriptionOO has got a原创 2015-07-22 15:28:12 · 1121 阅读 · 0 评论 -
cf 567 c
C. Geometric Progressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp loves geometric progressio原创 2015-08-15 16:19:19 · 1095 阅读 · 0 评论 -
codefoeces 567 D
D. One-Dimensional Battle Shipstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob love playing o原创 2015-08-15 23:22:36 · 809 阅读 · 0 评论 -
codeforces 570 c
#include #include #include using namespace std;#define N 300000 + 10int 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 · 1018 阅读 · 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 DescriptionTina Town is a原创 2015-08-15 23:24:57 · 810 阅读 · 0 评论 -
HDU4455
SubstringsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2581 Accepted Submission(s): 798Problem DescriptionXXX has an arra原创 2015-11-01 19:53:36 · 622 阅读 · 0 评论