-------Codeforces Round-----
yphacker
心之所动,且就随缘去吧
展开
-
Codeforces Round #317 (Div. 2) (572A Arrays,572B Order Book)
1.572A Arrays题目链接:http://codeforces.com/problemset/problem/572/A解题思路:取第一个数列的第k个数,然后倒着取第二个数列的第m个数,比较即可。。。AC代码:#include #include #include using namespace std;int a[100005];int b[10原创 2015-08-24 15:45:41 · 802 阅读 · 0 评论 -
Codeforces Round #330 (Div. 2) (595A,595B(容斥原理))
Vitaly and Night题目链接:http://codeforces.com/problemset/problem/595/A解题思路:It was easy realization problem. Let's increase the variable i from 1 to n, and inside let's increase the variable原创 2015-11-12 13:02:54 · 675 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) (617A,617B,617C,617D(Constructive ),617E(莫队算法))
比赛的时候由于入了一道题的坑,而且一直没爬出来。。。Elephant题目连接:http://codeforces.com/contest/617/problem/A解题思路:It's optimal to do the biggest possible step everytime. So elephant should do several steps by distan原创 2016-01-27 17:27:19 · 876 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) (618A,618B,618C)
Slime Combining题目链接:http://codeforces.com/problemset/problem/618/A解题思路:We can simulate the process described in the problem statement. There are many possible implementations of this, so s原创 2016-01-30 16:45:27 · 581 阅读 · 0 评论 -
8VC Venture Cup 2016 - Elimination Round (626A,626B,626C(二分),626D(概率))
Robot Sequence题目连接:http://codeforces.com/problemset/problem/626/A解题思路:We can simulate Calvin’s path on each substring, and check if he returns to the origin.Runtime: O(n3)AC代码:#i原创 2016-02-17 16:31:40 · 829 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) (629A,629B,629C(排列组合,动态规划),629D(线段树))
Far Relative’s Birthday Cake题目链接:http://www.codeforces.com/problemset/problem/629/A解题思路:Consider that we have rowi chocolates in the i'th row and coli chocolates in the i'th column.原创 2016-02-23 16:55:00 · 1018 阅读 · 0 评论 -
Codeforces Round #346 (Div. 2) (659A,659B,659C,659D(几何叉乘),659E(并查集))
Round House题目链接:http://codeforces.com/problemset/problem/659/A解题思路:The answer for the problem is calculated with a formula ((a - 1 + b) n + n) n + 1.Such solution has complexity原创 2016-04-01 09:15:38 · 1723 阅读 · 0 评论 -
April Fools Day Contest 2016 (656A,656B,656C,656D,656E,656F)
Da Vinci Powers题目链接:http://codeforces.com/problemset/problem/656/A解题思路:This problem asked to figure out an integer sequence from two samples and problem title. It turned out to be surprising原创 2016-04-02 12:10:52 · 1253 阅读 · 0 评论 -
Codeforces Round #365 (Div. 2) (703A,703B(容斥),703C(几何),703D(树状数组))
Mishka and Game题目链接:http://codeforces.com/problemset/problem/703/A解题思路:In this problem you had to do use the following algo. If Mishka wins Chris in the current round, then increase variable原创 2016-08-07 11:50:55 · 701 阅读 · 0 评论 -
Codeforces Round #327 (Div. 2) (591A,591B,590A(找规律),590B(二分))
Wizards' Duel题目链接:http://codeforces.com/problemset/problem/591/A解题思路:Let's start with determining the position of the first collision. Two impulses converge with a speed p + q, so the fi原创 2015-10-30 21:35:13 · 516 阅读 · 0 评论 -
Testing Round #12 (597A,597B,597C)
Divisibility题目链接:http://codeforces.com/problemset/problem/597/AAC代码:#include #include #include using namespace std;typedef long long ll;int main(){ ll k,a,b; while(~scanf("%ll原创 2015-11-12 13:12:26 · 521 阅读 · 0 评论 -
Codeforces Round #328 (Div. 2) (592A,592B,592C,592D)
PawnChess题目链接:http://codeforces.com/problemset/problem/592/A解题思路:Player A wins if the distance of his nearest pawn to the top of the board is less than or equal to the distance of the Player原创 2015-11-05 00:33:06 · 523 阅读 · 0 评论 -
Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1)(573A,573B)
1.Bear and Poker题目链接:http://codeforces.com/problemset/problem/573/A解题思路:Any positive integer number can be factorized and written as 2a·3b·5c·7d·....We can multiply given numbers by原创 2015-09-11 16:04:26 · 436 阅读 · 0 评论 -
Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)(574A,574B)
1.Bear and Elections题目链接:http://codeforces.com/problemset/problem/574/A解题思路:模拟即可。。。AC代码:#include #include #include #include using namespace std;multiset s;multiset::iterator it;原创 2015-09-11 15:43:30 · 494 阅读 · 0 评论 -
Codeforces Round #326 (Div. 2) (588A,588B,587A)
1.Duff and Meat题目链接:http://codeforces.com/problemset/problem/588/A解题思路:Idea is a simple greedy, buy needed meat for i - th day when it's cheapest among days 1, 2, ..., n.So, th原创 2015-10-17 11:07:22 · 961 阅读 · 0 评论 -
Codeforces Round #325 (Div. 2) (586A,586B,585A,585B)
1.Alena's Schedule题目链接:http://codeforces.com/problemset/problem/586/A解题思路:To solve this problem one should remove all leading and trailing zeroes from array and then calculate the nu原创 2015-10-17 14:49:47 · 851 阅读 · 0 评论 -
Codeforces Round #323 (Div. 2) (583A,583B,582A,582B)
1.Asphalting Roads题目链接:http://codeforces.com/problemset/problem/583/A解题思路:To solve the problem one could just store two arrays hused[j] and vused[j] sized n and filled with false initial原创 2015-10-04 17:19:58 · 1083 阅读 · 0 评论 -
Codeforces Round #329 (Div. 2) (593A,593B,593C,593D)
2Char题目链接:http://codeforces.com/problemset/problem/593/A解题思路:For each letter will maintain the total length of words (cnt1ci), which found it was alone, and for each pair of letters wi原创 2015-11-06 14:17:58 · 865 阅读 · 0 评论 -
Codeforces Round #259(454A,454B,453A(排列组合))
1.Little Pony and Crystal Mine题目链接:http://codeforces.com/problemset/problem/454/A解题思路:Brief description:Draw the grid graph as the problem said.Analysis:Just a few basi原创 2015-10-20 19:23:41 · 540 阅读 · 0 评论 -
Codeforces Round #324 (Div. 2) (584A,584B(排列组合),584C(构造),584D(哥德巴赫猜想),584E(置换群))
1.Olesya and Rodion题目链接:http://codeforces.com/problemset/problem/584/A解题思路:Two cases: t = 10 and t ≠ 10.If t = 10 then there are two cases again :). If n = 1 then answer is原创 2015-10-17 17:28:02 · 829 阅读 · 0 评论 -
Codeforces Round #365 (Div. 2) (705A,705B(博弈),704A)
Hulk题目链接:http://codeforces.com/contest/705/problem/A解题思路:Just alternatively print "I hate that" and "I love that", and in the last level change "that" to "it".Time Complexity: AC代码原创 2016-08-09 19:01:18 · 461 阅读 · 0 评论