随笔分类 -  codeforces

topcoder SRM 639 div2
摘要：见这里http://ygdtc.sinaapp.com/?p=257 阅读全文
posted @ 2014-11-29 16:32 acvc 阅读(134) 评论(0) 推荐(0)
Codeforces Round #277(Div. 2)
摘要：#includeusingnamespacestd;typedeflonglongLL;constintMAX=1e5+10;intmain(){LLn;while(cin>>n){if(n&1)coutusingnamespacestd;typedeflonglongLL;constintMAX=... 阅读全文
posted @ 2014-11-12 16:44 acvc 阅读(195) 评论(0) 推荐(0)
昨天还好没做cf
摘要：昨天还好没做cf，不然惨了。 阅读全文
posted @ 2014-11-06 19:37 acvc 阅读(123) 评论(0) 推荐(0)
topcoder SRM 637 div2+div1 250
摘要：http://ygdtc.sinaapp.com/?p=241 阅读全文
posted @ 2014-10-29 13:03 acvc 阅读(173) 评论(0) 推荐(0)
Codeforces Round #274 (Div. 2)
摘要：http://ygdtc.sinaapp.com/?p=233 阅读全文
posted @ 2014-10-20 21:45 acvc 阅读(118) 评论(0) 推荐(0)
Codeforces Round #271 (Div. 2)
摘要：http://ygdtc.sinaapp.com/?p=210 阅读全文
posted @ 2014-10-11 23:36 acvc 阅读(136) 评论(0) 推荐(0)
Bayan 2015 Contest Warm Up A~D
摘要：http://ygdtc.sinaapp.com/?p=173 阅读全文
posted @ 2014-10-07 15:57 acvc 阅读(146) 评论(0) 推荐(0)
Codeforces Round #253 (Div. 2)
摘要：很牛逼的比赛：A:给出一个字符串 求出一共出现了多少个不同的字母。模拟：http://codeforces.com/contest/443/submission/6925981B:给出一个字符串求最长的连续重复两次的子串。暴力枚举起点和长度：http://codeforces.com/contest... 阅读全文
posted @ 2014-06-21 01:19 acvc 阅读(252) 评论(0) 推荐(0)
Codeforces Round #249 (Div. 2) 总结
摘要：D.E还是很难的。。。。。C不想多说什么。。。A：提意：给出每一组人的个数，以及一次车载容量，求出最少需要多少次才能载走所有的人。water：http://codeforces.com/contest/435/submission/6741997 B:提意：给出一个数，最多可以交换两个数k次，并且... 阅读全文
posted @ 2014-05-31 16:05 acvc 阅读(180) 评论(0) 推荐(0)
Codeforces Round #244 (Div. 2)
摘要：今天是水题集啊。。。。A. Police Recruitstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe police departmen... 阅读全文
posted @ 2014-05-03 11:55 acvc 阅读(738) 评论(0) 推荐(0)
RCC 2014 Warmup (Div. 2) 蛋疼解题总结
摘要：A. Eliminationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe finalists of the "Russian Code ... 阅读全文
posted @ 2014-04-18 16:37 acvc 阅读(420) 评论(0) 推荐(0)
Codeforces Round #239 (Div. 2)
摘要：没事扯淡再写篇题解吧！反正只会大众题目。A:题意：给出n个队列以及每个人付费所需要的时间求出用时最短的一条队列。sl:比较逗比(叙述这么长)的水体，5分钟1Y 。1#include2#include3#include4usingnamespacestd;5constintMAX=100+10;6constintinf=0x3f3f3f3f;7intk[MAX];8intmain()9{10intn;inta;intret,ans;11while(scanf("%d",&n)==1)12{13ret=0;ans=inf;14for(inti=0;i2#include3 阅读全文
posted @ 2014-03-31 20:23 acvc 阅读(348) 评论(0) 推荐(0)
Codeforces Round #237 (Div. 2)
摘要：A. Valera and Xtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunat 阅读全文
posted @ 2014-03-20 21:20 acvc 阅读(368) 评论(0) 推荐(0)
Codeforces Round #236 (Div. 2)
摘要：A. Nutstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou haveanuts and lots of boxes. The boxes have a wonderful feature: if you putx(x ≥ 0)divisors (the spacial bars that can divide a box) to it, you get a box, divided intox + 1sections.You are 阅读全文
posted @ 2014-03-17 20:34 acvc 阅读(412) 评论(0) 推荐(0)
Codeforces Round #235 (Div. 2)
摘要：A. Vanya and Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya loves playing. He even has a special set of cards to play with. Each card has a single integer. The number on the card can be positive, negative and can even be equal to zero. 阅读全文
posted @ 2014-03-11 11:07 acvc 阅读(775) 评论(6) 推荐(0)
Codeforces Round #234 (Div. 2)
摘要：A. Inna and Choose Optionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere always is something to choose from! And now, instead of "Noughts and Crosses", Inna choose a very unusual upgrade of this game. The rules of the game are giv 阅读全文
posted @ 2014-03-06 19:39 acvc 阅读(584) 评论(0) 推荐(0)
Codeforces Round #219 (Div. 2) D题
摘要：D. Counting Rectangles is Funtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is ann × mrectangular grid, each cell of the grid contains a single integer: zero or one. Let's call the cell on thei-th row and thej-th column as(i, j).L 阅读全文
posted @ 2014-03-04 21:50 acvc 阅读(352) 评论(0) 推荐(0)
Codeforces Round #228 (Div. 2)
摘要：做codeforces以来题目最水的一次A题：Fox and Number Game题意:就是用一堆数字来回减，直到减到最小值为止，再把所有最小值加，求这个值sol: 简单数论题目，直接求所有数字的最大公约数即可ps: 以前cf出过这道题目啊，出题人没救了 5分钟300人过1#include2#include3#include4usingnamespacestd;5constintMAX=1000;6intnum[MAX];7intgcd(inta,intb)8{9returnb==0?a:gcd(b,a%b);10}11intmain()12{13intn;14while(scanf(&qu 阅读全文
posted @ 2014-02-04 14:57 acvc 阅读(351) 评论(0) 推荐(0)