- 博客(18)
- 资源 (4)
- 问答 (2)
- 收藏
- 关注
RSS订阅原创 BestCoder Round #85
HDU【5776】——sum|Time Limit: 2000/1000 MS (Java/Others) | Memory Limit: 131072/131072 K (Java/Others)|Problem DescriptionGiven a sequence, you’re asked whether there exists a consecutive subsequence who
2016-07-31 14:19:45
422
原创 2016 Multi-University Training Contest 4
HDU【5763】——Another Meaning Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionAs is known to all, in many cases, a word has two meanings. Such as “he
2016-07-29 12:02:51
1016
原创 2016 Multi-University Training Contest3
HDU【5752】——Sqrt Bo Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionLet’s define the function f(n)=|n√|f(n)=|\sqrt{n}|.Bo wanted to know the mini
2016-07-27 15:27:16
1551
4
原创 POJ【3411】——Hie with the Pie
Time Limit: 2000MS Memory Limit: 65536KDescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire
2016-07-26 10:44:26
630
原创 POJ【1185】——炮兵阵地
Time Limit: 2000MS Memory Limit: 65536KDescription司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用”H” 表示），也可能是平原（用”P”表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队（山地上不能够部署炮兵部队）；一支炮兵部队在地图上的攻击范围如图中黑色区域所示：如果在
2016-07-26 08:49:33
660
原创 POJ【3254】——Corn Fields
Corn Fields Time Limit: 2000MS Memory Limit: 65536KDescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow s
2016-07-25 17:38:15
446
原创 POJ【1691】——Painting A Board
Painting A Board Time Limit: 1000MS Memory Limit: 10000KDescriptionThe CE digital company has built an Automatic Painting Machine (APM) to paint a flat board fully covered by adjacent non-overlappi
2016-07-25 16:06:29
576
原创 BestCoder Round #84
HDU【5747】——Aaronson Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionRecently, Peter saw the equation x0+2x1+4x2+...+2mxm=nx_0+2x_1+4x_2+...+
2016-07-24 13:08:53
523
原创 Codeforces 364Div2
A. Cards time limit per test 1 second memory limit per test 256 megabytesThere are n cards (n is even) in the deck. Each card has a positive integer written on it. n2\frac{n}{2} people will pla
2016-07-23 13:30:39
991
原创 2016 Multi-University Training Contset 2
HDU【5734】-Acperience Time Limit: 4000/2000 MS (Java/Others) Memory Limit:65536/65536 K (Java/Others)Problem DescriptionDeep neural networks (DNN) have shown significant improvements in several appl
2016-07-21 21:04:21
1328
原创 Codeforces 363 Div2
A. Launch of Collider time limit per test 2 seconds memory limit per test 256 megabytesThere will be a launch of a new, powerful and unusual collider very soon, which located along a straight l
2016-07-20 09:31:55
1295
原创 2016 Multi-University Training Contest 1
1001-【5723】——Abandoned countryTime Limit: 8000/4000 MS 【HDU5730】Shell Necklace——CDQ+FFT
2016-07-19 21:02:15
886
原创 数论刷题-uva【10533】 - Digit Primes
A prime number is a positive number, which is divisible by exactly two different integers. A digit prime is a prime number whose sum of digits is also prime. For example the prime number 41 is a digit
2016-07-18 22:00:34
1194
原创 数论刷题-uva【10168】- Summation of Four Primes
Euler proved in one of his classic theorems that prime numbers are infinite in number. But can every number be expressed as a summation of four positive primes? I don’t know the answer. May be you ca
2016-07-18 21:15:13
690
原创 POJ【3026】- Borg Maze
Time Limit: 1000MS Memory Limit: 65536KDescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to descri
2016-07-18 21:04:17
563
原创 BestCoder 2nd Anniversary
HDU【5719】——ArrangeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionAccidentally, Cupid, god of desire has hurt himself with his own dart and falle
2016-07-18 07:57:41
438
原创 【Hihocder 1329】——Splay
伸展树的插入，区间删除，区间查询,自己手残，debug了半天#include <bits/stdc++.h>using namespace std;const int INF = 0x3f3f3f3f;typedef struct node { int data; node *Left,*Right,*fa;}Node; void Zig(Node *p) { Node *C
2016-07-17 21:44:14
427
原创 Codeforces 360Div2
A. Opponents time limit per test 1 second memory limit per test 256 megabytesArya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents ha
2016-07-03 10:33:44
856
OCLSDKLightAMD.zip
2019-10-15
ZOJ2676最小割01规划问题
2016-02-25
最小割在图论中的应用问题
2016-02-24
TA创建的收藏夹 TA关注的收藏夹
TA关注的人