Codeforces
文章平均质量分 65
BuringCode
长大之后就接触到了很多小时候觉得遥不可及的东西
然后才发现 自己离这个世界的真相 还差很远很远
展开
-
Codeforces Round #340 (Div. 2) C. Watering Flowers(暴力枚举)
C. Watering Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA flowerbed has many flowers and two fountains.原创 2016-07-27 18:35:53 · 278 阅读 · 0 评论 -
Codeforces Round #382 (Div. 2) 735A - Ostap and Grasshopper
http://codeforces.com/problemset/problem/735/A题意:一只蚂蚱在路上蹦,输入路的长度n和蚂蚱每次蹦的距离k,在这条路上,蚂蚱只能落在'.'上,不能落在'#'上,蚂蚱从G开始蹦,若能蹦到T,输出YES,否则NO。代码:#include #include using namespace std;char ch[1000]原创 2016-11-28 12:30:59 · 270 阅读 · 0 评论 -
Codeforces Round #358 (Div. 2)(A) Alyona and Numbers
http://codeforces.com/problemset/problem/682/A题意:输入n、m,找出所有1代码:#include #include using namespace std;int n,m;long long ans;int main(){ ans=0; scanf("%d %d",&n,&m); for(原创 2016-11-24 21:31:22 · 114 阅读 · 0 评论 -
Codeforces Round #381 (Div. 2) A. Alyona and copybooks
http://codeforces.com/problemset/problem/740/A题意:给出四个数据n、a、b、c,其中a、b、c、分别代表补一、补二、补三的花费,问用补一、补二、补三的方法将数据n补成4的倍数所需的最少花费。 代码:#include #include using namespace std;long long n,a,原创 2016-11-24 21:14:17 · 219 阅读 · 0 评论 -
Codeforces Round #381 (Div. 2) A. Alyona and flowers
http://codeforces.com/problemset/problem/740/B题意:给出一组n个数和m条指令,每条指令给出了区间[L,R],对于每天指令,算出第L个数到第R个数的和,最后将所有大于0的和相加得出结果。代码:#include using namespace std;int arr[20000];int n,m;int main(原创 2016-11-24 21:23:30 · 214 阅读 · 0 评论 -
B. Spotlights
B. Spotlightstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTheater stage is a rectangular field of size n原创 2016-11-21 23:59:25 · 218 阅读 · 0 评论 -
A. Interview with Oleg
A. Interview with Olegtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has interviewed Oleg and has原创 2016-11-21 23:57:08 · 290 阅读 · 0 评论 -
Codeforces Round #359 (Div. 2) B
B. Little Robber Girl's Zootime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Robber Girl likes to sca原创 2016-09-04 16:00:32 · 192 阅读 · 0 评论 -
Codeforces Round #359 (Div. 2) A
A. Free Ice Creamtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter their adventure with the magic mirr原创 2016-09-04 15:57:54 · 231 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) A
A. Beru-taxitime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy lives at point (a, b) of the coordinate原创 2016-09-04 15:34:51 · 165 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) B
B. Interesting drinktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy likes to rest after a hard wor原创 2016-09-04 15:29:16 · 191 阅读 · 0 评论 -
Codeforces Round #382 (Div. 2) 735B - Urbanization
http://codeforces.com/problemset/problem/735/B题意:输入数组元素个数n,从数组中分别选出n1、n2个数字,分为两组,算出两组平均数的和,求平均数的和的最大值。代码:原创 2016-11-28 12:57:20 · 358 阅读 · 0 评论