You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

 
 
 
 
1.
By YouKn0wWho, 2 months ago, In English
The Ultimate Topic List (with Resources, Problems and Templates) This post took $4$ years to make. And this is the most significant thing that I have ever shared in my whole life. #### Story Hi, I have been doing CP for like $4$ years and from the very beginning what I have been feeling is a need for a comprehensive topic list that will contain all sorts of topics from easy to advanced with corresponding tutorials, problem lists and templates so that I wouldn't have to look at different sites, from here to there. So what do you do when you think something is missing from the world? Yeah, you create that thing! So here I am, sharing the ultimate topic list that you will need in CP. When I say that it took me $4$ years to make it, I genuinely mean it. I have been collecting them from the inception of my CP journey and yesterday I thought that it got its almost complete shape. You may not imagine the sheer excitement hidden under each of the characters of this post. #### Payment You can pay me just by upvoting this blog and by being a bet...
%20Automaton.cpp"> code 1 321, > 1 321 Bounded

Read more »

 
 
 
 
  • Vote: I like it
  • +4383
  • Vote: I do not like it

 
 
 
 
2.
By igdor99, 6 years ago, translation, In English
Codeforces Round #321 Editorial [problem:580A] Заметим, что если в массиве есть две пересекающиеся непрерывные неубывающие подпоследовательности, то их можно объединить в одну. Поэтому можно просто проходиться по массиву слева направо. Если текущую подпоследовательность можно продолжить с помощью $i$-го элемента, то делаем это, иначе начинаем новую. Ответом будет максимальная из всех найденных подпоследовательностей. Асимптотика — $O(n)$. [Решение](http://ideone.com/dIGhiB) [problem:580B] Сначала отсортируем всех друзей по возрастанию денег. Теперь ответом будет какой-то подотрезок массива. Далее будем использовать метод двух указателей для нахождения требуемого подотрезка. Асимптотика — $O(n$ $log$ $n)$. [Решение](http://ideone.com/k4Hlxv) [problem:580C] Будем спускаться по дереву от корня, поддерживая дополнительный параметр $k$ — количество встреченных подряд вершин с котами. Если $k$ превысило $m$, то выходим. Тогда ответ — это количество листьев, до которых мы ...
Codeforces Round #321 Editorial

Read more »

 
 
 
 
  • Vote: I like it
  • +34
  • Vote: I do not like it

 
 
 
 
3.
By -Morass-, history, 4 years ago, In English
Problem Topics Good Day to you! I've been asked to make some topic-wise list of problems I've solved. Even though I couldn't involve all problems, I've tried to involve at least "few" problems at each topic I thought up (I'm sorry if I forgot about something "easy"). I've alredy made such list once anyway I've tried to include more problems now &mdash; so here it is: <spoiler summary="aho"> http://www.spoj.com/problems/ADAJOBS/ URI 2226 (5) //[NICE][NUMBERS][DP] http://www.spoj.com/problems/SUB_PROB/en/ http://codeforces.com/contest/696/problem/D 8 http://www.spoj.com/problems/AHOCUR/ 5 //Aho-Corassic + DP https://www.codechef.com/problems/LYRC (5) //Sample aho-brute-force http://codeforces.com/problemset/problem/346/B //Proposed by [user:bradyawn,2019-08-03] </spoiler> <spoiler summary="automat"> 6861 [LA] //CYK UVA 10679 //Suffix Automat http://www.spoj.com/problems/STRMATCH/ //Suffix Automat &mdash; trie might do too http://www.spoj.com/problems/NSUBST...
http://codeforces.com/contest/321/problem/E (7) //VERY NICE — D&C Trick

Read more »

 
 
 
 
  • Vote: I like it
  • +428
  • Vote: I do not like it

 
 
 
 
4.
By YoyOyoYOy000y000, history, 22 months ago, In English
Centroid Decomposition on a tree(Beginner) ## When Centroid Decomposition comes? 1. Suppose a problem says that how many paths have a length exactly k in a tree. 2. Or, how many paths have xor k. 3. Sum of all xor path in a tree. 4. update a node Black to white or white to black. now query the shortest path from a node to a white node. etc. **So, it is clear, when a paths problem comes then we can use Centroid Decomposition.** **For a single node query or from a specific node, DSU on Tree may do it.** ## Algorithm: ### 1. Find a centroid of current tree T. `What is Centroid? ` Simply Centroid is a node if we delete it. It makes some subtrees where every subtree size must be less than **sz/2** { sz is the size of the current tree T.} `How can we find it?` => Take a node random node of current tree T. Now if it's every subtree size less than sz/2. Then it is a centroid. => If not, go to the highest size of the subtree. **Note: In a tree only two Centroid possible F...
/contest/321/problem/C) 6. [Freezing with Style](https://codeforces.com/contest/150/problem/E, 5. [Ciel the Commander](https://codeforces.com/contest/321/problem/C)

Read more »

 
 
 
 
  • Vote: I like it
  • +133
  • Vote: I do not like it

 
 
 
 
5.
By Vladik, 6 years ago, translation, In English
Codeforces Round #321 (Div. 2) Всем доброго времени суток! [22 сентября 2015 года в 19:30 MSK](http://goo.gl/aZ43my) состоится очередной раунд для участников из второго дивизиона. Традиционно, участники из первого дивизиона могут участвовать в соревновании вне конкурса. Авторами раунда являются я (Владислав Вишневский) и [user:igdor99,2015-09-17](Игорь Дорошев). Хотелось бы сказать большое спасибо [user:Zlobober,2015-09-17](Максиму Ахмедову) за помощь в подготовке задач, [user:Delinur,2015-09-17](Марии Беловой) за перевод условий на английский, [user:MikeMirzayanov,2015-09-17](Михаилу Мирзаянову) за замечательные системы Codeforces и Polygon, а также нашим друзьям [user:Dmitry_Aksenik,2015-09-17](Дмитрию Аксенику) и [user:RevtIvan,2015-09-17](Ивану Ревту) за помощь в подготовке раунда. Это наш первый раунд, и надеемся, что не последний! Вам будет предложено 5 задач и 2 часа на их решение. Главным героем раунда является попугай Кефа, любящий деньги и рестораны. Всем удачи и высокого рейтинга! **UPD:...
Codeforces Round #321 (Div. 2)

Read more »

 
 
 
 
  • Vote: I like it
  • +191
  • Vote: I do not like it

 
 
 
 
6.
By ak2006, 6 months ago, In English
Graph Theory Playlist Hello everyone, After concluding my DP playlist on YouTube where I discussed my solutions to 18 intermediate level DP problems (rated 1600 to 2000), I just started a Graph Theory Problem Solving playlist where I plan to post my solutions to intermediate level graph theory problems every 2nd day during the month of June 2021. [DP Playlist] (https://www.youtube.com/playlist?list=PLzVLIdIx9dQxwAN5mMkzdvK2B4rV8879j) [Graph Theory Playlist] (https://www.youtube.com/playlist?list=PLzVLIdIx9dQwzso2IwXCQq3aEicK02iKF) [Tutorial on DFS on Tree] (https://www.youtube.com/watch?v=0vNXkdPserI) The problem list is as under: 1) **Kefa and Park (Round 321 Div 2 C Rated 1500)** &mdash; DFS on a Tree [Problem Link] (https://codeforces.com/contest/580/problem/C) [Video Editorial Link] (https://www.youtube.com/watch?v=hXv0KBoFDBY) 2) **Graph Without Long Directed Paths (Round 550 Div 3 F Rated 1700)** &mdash; Bipartite Graphs; 2-Coloring [Problem Link] (https://codeforces.com/...
) The problem list is as under: 1) **Kefa and Park (Round 321 Div 2 C Rated 1500)** — DFS, 1) **Kefa and Park (Round 321 Div 2 C Rated 1500)** — DFS on a Tree

Read more »

 
 
 
 
  • Vote: I like it
  • +64
  • Vote: I do not like it

 
 
 
 
7.
By ayushrai6699, history, 5 months ago, In English
Maximal string with a slight change.. I was solving [maximal string](https://www.interviewbit.com/problems/maximal-string/) (Given a string A generates maximum string doing almost B swaps). I got curious, regarding what if it was exactly K swaps or at least K swaps. I was able to solve atmost K swaps but got stuck in the other 2. The code provided is for atmost K swaps. ~~~~~ void solve1(string a,string &b,int k,int i){ if(i==a.size()|| k==0) return; for(int j=i+1;j<a.size();j++){ if(a[j]-'0'>a[i]-'0'){ swap(a[j],a[i]); if(a.compare(b)>0) b=a; solve1(a,b,k-1,i+1); swap(a[j],a[i]); } else{ solve1(a,b,k,i+1); } } } string Solution::solve(string A, int B) { string b=A; solve1(A,b,B,0); return b; } ~~~~~ How should I change the code to get the desired result, if anyone wondering about test cases, the following line provides the test cases for the other two problems...
Input:- A = "321" B = 1

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

 
 
 
 
8.
By erikr, 8 years ago, In English
Haskell solutions For those who are interested, here is a list of all problems for which Haskell solutions have been submitted. (Use the 'Status filter' to show only the Haskell submissions.) [1A](http://codeforces.com/problemset/status/1/problem/A) [1B](http://codeforces.com/problemset/status/1/problem/B) [1C](http://codeforces.com/problemset/status/1/problem/C) [2A](http://codeforces.com/problemset/status/2/problem/A) [2B](http://codeforces.com/problemset/status/2/problem/B) [2C](http://codeforces.com/problemset/status/2/problem/C) [3A](http://codeforces.com/problemset/status/3/problem/A) [3B](http://codeforces.com/problemset/status/3/problem/B) [3C](http://codeforces.com/problemset/status/3/problem/C) [3D](http://codeforces.com/problemset/status/3/problem/D) [4A](http://codeforces.com/problemset/status/4/problem/A) [4B](http://codeforces.com/problemset/status/4/problem/B) [4C](http://codeforces.com/problemset/status/4/problem/C) [4D](http://codeforces.com/problemset/status/4/problem/D)...
/problemset/status/320/problem/B) [321A](http://codeforces.com/problemset/status/321/problem/A) [321B](http, [321A](http://codeforces.com/problemset/status/321/problem/A) [321B](http://codeforces.com

Read more »

 
 
 
 
  • Vote: I like it
  • +19
  • Vote: I do not like it

 
 
 
 
9.
By khatribiru, history, 5 years ago, In English
Dynamic Programming Optimizations ( Problems ) This Blog is Just the List of Problems for Dynamic Programming Optimizations.Before start read [This](http://codeforces.com/blog/entry/8219) blog. #### **1.Knuth Optimization** Read [This](https://www.quora.com/What-is-Knuths-optimization-in-dynamic-programming) article before solving Knuth optimization problems. [Problem 1](https://uva.onlinejudge.org/external/100/10003.pdf) [Problem 2](https://uva.onlinejudge.org/external/103/10304.pdf) [Problem 3](http://codeforces.com/gym/100212/attachments/download/1727/20042005-winter-petrozavodsk-camp-andrew-stankevich-contest-10-en.pdf) ( **C** ) [Problem 4](http://www.spoj.com/problems/BRKSTRNG/) [Problem 5](https://uva.onlinejudge.org/external/120/12057.pdf) [Problem 6](https://uva.onlinejudge.org/external/128/12836.pdf) #### **2. Divide and Conquer Optimization** Read [This](https://www.quora.com/What-is-divide-and-conquer-optimization-in-dynamic-programming) article before solving Divide and Conquer Optimization problems...
/challenges/mining) [Problem 5](http://codeforces.com/contest/321/problem/E) [Problem 6](http

Read more »

 
 
 
 
  • Vote: I like it
  • +199
  • Vote: I do not like it

 
 
 
 
10.
By saiprajna_nayak, 6 years ago, In English
Solving 321 C By first finding depth of each node using BFS, then selecting nodes with maximum depth, we can implement Dijsktra to find the path. Once you get the path, just look at the path for 15 seconds else you'll get WA. Then look at cats in path. Also look at hawks , snipers, terrorists as well, since they can easily kill a parrot. Then do headshot snipers and use cats to kill the hawks. After doing all this, use BrainF**k to submit your code Have a nice Day
Solving 321 C

Read more »

 
 
 
 
  • Vote: I like it
  • -15
  • Vote: I do not like it

 
 
 
 
11.
By TexanElite, 21 month(s) ago, In English
Statistics of Problems on Div 1 & Div 2 contests I made statistics of the rating and tags of problems based on their in-contest letter assignment (A, B, C, etc.) using the Codeforces API. What I took into consideration ------------------ First of all, only problems taken from contests labeled with Div. 1 or Div. 2 were taken into consideration (I say labeled because I only checked if the division string existed in the contest name). Contests that were labeled Div. 3 or didn't have a listed division (Global Rounds, for example) were not used. Div. 1 problems are offset by the Div. 2 problems. What I mean by this is usually, the Div. 2 C is the Div. 1 A, and in these statistics, I represented them like the former so that I wouldn't get Div. 1 A ratings mixed with Div. 2 A ratings because, well, that would be bad and it was easier lol (the API did it for me). Only problems representable up to H were used, because the later ones were too scarce (and quite frankly, odd in terms of ratings). Possible Sources of Error -------------...
, **brute force**: 145 - B — **implementation**: 321, **greedy**: 180, **math**: 171 - C &mdash, ; **implementation**: 426, **math**: 176, **brute force**: 145 - B — **implementation**:321, **greedy

Read more »

 
 
 
 
  • Vote: I like it
  • +124
  • Vote: I do not like it

 
 
 
 
12.
By Gasser, history, 5 years ago, In English
321C — C. Ciel the Commander test cases are weak Hello everyone. As a person that extremely enjoys competitve programming, and thus enjoys Codeforces problems I really want to adress this issue. Problem link: http://codeforces.com/contest/321/problem/C My submission (Wrong code and get AC): http://codeforces.com/contest/321/submission/26788450 rng_58 submission (Right Code and get AC too): http://codeforces.com/contest/321/submission/3973635 Input: 60 1 2 1 3 3 4 3 5 5 6 5 7 7 8 7 9 9 10 9 11 11 12 11 13 13 14 13 15 15 16 15 17 17 18 17 19 19 20 19 21 21 22 21 23 23 24 23 25 25 26 25 27 27 28 27 29 29 30 29 31 31 32 31 33 33 34 33 35 35 36 35 37 37 38 37 39 39 40 39 41 41 42 41 43 43 44 43 45 45 46 45 47 47 48 47 49 49 50 49 51 51 52 51 53 53 54 53 55 55 56 55 57 57 58 57 59 59 60 OUTPUT: (rng_58) red coder it's the right output E F D E E F C D E F D E E F B C E F D E C D E F D E E F A B E F D E E F C D E F D E E F B C E F D E E F C D E F D E E F m...
Codeforces problems I really want to adress this issue. Problem link: http://codeforces.com/contest/321, My submission (Wrong code and get AC): http://codeforces.com/contest/321 /submission/26788450, Problem link: http://codeforces.com/contest/321/problem/C, rng_58 submission (Right Code and get AC too): http://codeforces.com/contest/321 /submission

Read more »

 
 
 
 
  • Vote: I like it
  • +8
  • Vote: I do not like it

 
 
 
 
13.
By s1d_3, history, 6 years ago, In English
Codechef September Cook-off clashing with Codeforces round 321 Could we change the time of the event please? There are a large number of us who do both of them. This is the first time I see a clash. I posted a similar post in codechef as well: https://discuss.codechef.com/questions/75130/september-cook-off-clashing-with-codeforces-round-321 But Codechef has been hosting the cookoff at the same time for the last few years. It doesn't make sense for them to change it.
Codechef September Cook-off clashing with Codeforces round 321, ://discuss.codechef.com/questions/75130/september-cook-off-clashing-with-codeforces-round- 321 But Codechef, /september-cook-off-clashing-with-codeforces-round-321

Read more »

 
 
 
 
  • Vote: I like it
  • +16
  • Vote: I do not like it

 
 
 
 
14.
By Algorithm_, history, 10 months ago, In English
Centroid / Separator Decomposition Resource: 1. https://www.youtube.com/watch?v=LqHAS5EPg1A&list=PLv0QPiaV6CZsUiM0fa0WDLOUiio9jxvfB&fbclid=IwAR0NXQxVJJ1_FlONBoXFITZMlFEu70yPeHkSulghAldHGuBQ5Lc-qRzG8V8 2. https://www.quora.com/q/threadsiiithyderabad/Centroid-Decomposition-of-a-Tree?fbclid=IwAR0F5yt8vdociDQH2Qc3-R-IW1Kh6yR__dGinIEYUDa3EPHYUQXVxh82-Z4 3. https://sai16vicky.wordpress.com/2014/11/01/divide-and-conquer-on-trees-centroid-decomposition/?fbclid=IwAR3J92Y3UVkxi-SoECmIf2LevgYswONN-w4VADVkm2ghuYu1x8nDw86lF4A 4. https://codeforces.com/blog/entry/19175?fbclid=IwAR0wkAhqOLk6gHRJwIITiLPsj0Nv3zY7xE5d5MYh76C_HBYdqZgrI4wF3yE <spoiler summary="Template"> https://ideone.com/EuKp1v?fbclid=IwAR0YNxRaz0ZdMjwKYXucqVbMWISe3I-_DqhVxF-iMZ-RdBw8WnAVd2Q2ivE </spoiler> Practice: 1. https://codeforces.com/problemset/problem/321/C 2. https://codeforces.com/problemset/problem/161/D 3. https://codeforces.com/problemset/problem/342/E 4. https://www.spoj.com/problems/QTREE5/en/
/problemset/problem/321/C 2. https://codeforces.com/problemset/problem/161/D 3. https://codeforces.com, 1. https://codeforces.com/problemset/problem/321/C

Read more »

 
 
 
 
  • Vote: I like it
  • +20
  • Vote: I do not like it

 
 
 
 
15.
By Pi-nan, history, 22 months ago, In English
Need Help for this problem can anyone explain to me how to solve this problem [ Ceil and Duel](https://codeforces.com/contest/321/problem/B) using min-cost max flow? my approach was to build a flow network i.e. if node i have atk value >= node j ceil value then there will be an edge from j to i with capacity 1 and cost (atk[i]-ceil[j]), similarly if node i has def value > node j ceil value then there will be edge from j to i with capacity 1 and cost 0, and then connect all ceil's node to super source i.e. superSource -> ceil, and connect all atk and def node to super sink i.e. atk/def -> superSink with capacity 1 and cost 0. after building this network we will find min_cost_max_flow and after this, if all atk/def nodes are visited then we will add ceil[i] such that ceil's ith node is not used. I don't know why this is failing on test 28. [Link to my submission ](https://codeforces.com/contest/321/submission/69000927)
/321/problem/B) using min-cost max flow?, [Link to my submission ](https://codeforces.com/contest/321/submission/69000927)

Read more »

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

 
 
 
 
16.
By AJAYHAYAGREEVE, history, 4 years ago, In English
solution for problem 440 C hi every one. im having a doubt in codeforces problem 440 C. here is the link http://codeforces.com/problemset/problem/440/C. My approach was A number x can be represented by having the number with only ones which is less than the given number. for eg if number is 40 one approach is taking 11. Another is having the number with only ones which is greater than the given number. i.e. 111 for 40 then take absolute difference between the number and the given number i.e abs(11 – 40) = 29 and abs(111 – 40) which is 71. Now call the function again for the new n. in this case fun(29) and fun(49). Now added with the number of ones take the min of these two i.e min(fun(29) + 2, fun(71) + 3). that is the answer. Also if we can represent the number with the ones alone. for eg 11 then return 2 just. i.e without computing min(fun(11-11) + 2, fun(111- 11) + 3); But i got wrong answer in test 14. the input is 81924761239462. and the expected output is 321. And my output is 395. C...
answer in test 14. the input is 81924761239462. and the expected output is 321 . And my output is 395, But i got wrong answer in test 14. the input is 81924761239462. and the expected output is321

Read more »

 
 
 
 
  • Vote: I like it
  • -3
  • Vote: I do not like it

 
 
 
 
17.
By ALogB, history, 12 months ago, In English
Help needed in Problem 321B I am solving this problem got the greedy solution but interested to solve this via dp as well can someone explain the dp solution in more better way than editorial ( i am unsatisfied with editorial). Problem Link -> https://codeforces.com/problemset/problem/321/B
Problem Link -> https://codeforces.com/problemset/problem/321/B

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

 
 
 
 
18.
By WitchOfTruth, history, 14 months ago, In English
Contests hack statistics (Number of hacks by round) Just felt like gathering some data about hacks. Parsed around ~400 last contests Probably it would be worth it to also include SFT, but whatever Educational 96 is not finished yet but also whatever Last 100 ------------------ **847** Educational Codeforces Round 96 (Rated for Div. 2) **30** Codeforces Global Round 11 **248** Codeforces Round #674 (Div. 3) **0** 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) **97** Bubble Cup 13 &mdash; Finals [Online Mirror, unrated, Div. 2] **86** Bubble Cup 13 &mdash; Finals [Online Mirror, unrated, Div. 1] **20** Codeforces Round #675 (Div. 2) **1** Codeforces Round #672 (Div. 2) **70** Codeforces Round #671 (Div. 2) **58** Educational Codeforces Round 95 (Rated for Div. 2) **3** Codeforces Round #673 (Div. 2) **11** Codeforces Round #673 (Div. 1) **73** Codeforces Round #667 (Div. 3) **121** Grakn Forces 2020 **4** Co...
! **314** Codeforces Round #644 (Div. 3) **321** Educational Codeforces Round 88 (Rated, , Algo Muse! **314** Codeforces Round #644 (Div. 3) **321** Educational Codeforces Round 88, . 2)** 321 **Codeforces Round #579 (Div. 3)** 320 **Educational Codeforces Round 79 (Rated

Read more »

 
 
 
 
  • Vote: I like it
  • +44
  • Vote: I do not like it

 
 
 
 
19.
By bluemmb, history, 6 years ago, In English
Cheating Ring Invitation Email I got this email some hours ago : Title : Codeforces , From : Penny Zhang <pzhang9191@gmail.com> _Hello all,_ __ _If you're interested in exchanging solutions to Codeforces (and maybe even TopCoder) problems in-contest, reply to let me know and I'll explain the system in more detail. The main goal of the system is to prevent leeching (receiving solutions, but not giving), and to prevent detection (altering code). I'm expecting a final ring of size 4-8. I suggest you make a new email account for this to maintain anonymity; use a proxy if you want to take it a step farther. Ideally, no one in the ring should know a single other person._ __ _Quick note: This setup will not be ready by the next contest, which is in less than 12 hours. I hope to be ready for round 321 (in several days), though._ __ _Again, reply with "I'm interested" using an alternate email account (preferably), and I'll include you in a group email._ __ _Thank you all,_ _pzhang_ ...........................
by the next contest, which is in less than 12 hours. I hope to be ready for round321 (in several

Read more »

 
 
 
 
  • Vote: I like it
  • +76
  • Vote: I do not like it

 
 
 
 
20.
By Chi, history, 3 years ago, In English
Help with TLE verdict I tried solving problem [321C &mdash; Ciel the commander](https://codeforces.com/problemset/problem/321/C) with centroid decomposition. I think thats what many people did and got an AC with, but [my submission](https://codeforces.com/contest/321/submission/47287346) got a TLE. Could anyone tell me why did it exceed the time limit?
/321/C) with centroid decomposition. I think thats what many people did and got an AC with, but [my

Read more »

 
 
 
 
  • Vote: I like it
  • +27
  • Vote: I do not like it

 
 
 
 
21.
By Xellos, history, 7 years ago, In English
Invitation to IPSC 2015 ![ ](http://ipsc.ksp.sk/static/ipsc.gif) Следующий тур Интернетовского Соревнования Решения Задач ([Internet Problem Solving Contest](http://ipsc.ksp.sk)) приблизиться! Задачи на IPSC имеют различные форматы, от стандартных алгоритмических до задач для взаимодействия с грейдером или поиска конкретного входа. Все задачи суть по английски. Большинство задач иметь легкий вход (стоимость: 1 очко) и трудный вход (стоимость: 2 очки); положение вычислено как на ACM, только неправильный ответ на легкий вход дает пенальти 10 минут &mdash; не 20. Входные файлы доступны для скачивания перед соревнованием и вы только посылаете ваше выходное файлы (как на GCJ, только никакие дальше ограничение по времени нет). Это есть соревнование для команд трех или менее людей. IPSC 2015 происходит 20го июня, от [11:00 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?month=6&day=20&year=2015&hour=11&min=0&sec=0) до [16:00 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?month=6&da...
| [user:rajat1603,2015-06-21] | [user:sidhbansal,2015-06-21] | [user:additya1998,2015-06-21] | |321, -06-21] | [user:sidhbansal,2015-06-21] | [user:additya1998,2015-06-21] | | 321 | 10 | 817 | Flawless, ] | [user:additya1998,2015-06-21] | | 321 | 10 | 817 | Flawless | [user:fdg,2015-06-21] | [user:Furko,2015-06, ] | | 321 | 10 | 817 | Flawless | [user:fdg,2015-06-21] | [user:Furko,2015-06-21] | [user:mgch,2015-06-21

Read more »

 
 
 
 
  • Vote: I like it
  • +167
  • Vote: I do not like it

 
 
 
 
22.
By rhezo, history, 6 years ago, In English
How is this test case correct for Div1 250 SRM 680? [Solved] How is the test case given in the [image](http://codeforces.com/predownloaded/b4/cc/b4cc3f35204a5c7a22fb5073163bea9dfe5986fa.png) for [this](https://community.topcoder.com/stat?c=problem_statement&pm=14129) problem correct? The only possible sets are {9,10,11} or {9,10,12}. None of them have exactly n/2 terms even or odd. The test case is : {4, 321, {6, 12, 2, 3, 9, 8, 10, 5}, {0, 3, 0, 0, 1, 0, 2, 0}}. Please help!
exactly n/2 terms even or odd. The test case is : {4, 321, {6, 12, 2, 3, 9, 8, 10, 5}, {0, 3, 0, 0, 1, 0

Read more »

 
 
 
 
  • Vote: I like it
  • +5
  • Vote: I do not like it

 
 
 
 
23.
By EmilConst, history, 20 months ago, In English
75982
60000 3782 2 1 399 3 1 321 4 1 320 5 4 236 6 4 295 7 2 892 8 1 277 9 3 761 10 4 1000 11 4 453 12 7

Read more »

 
 
 
 
  • Vote: I like it
  • +50
  • Vote: I do not like it

 
 
 
 
24.
By umsh1ume, history, 5 years ago, In English
A counting problem In how many ways can we make n digit number from 1,2 and 3 such that no continuous triplet has distinct integers.Ex: 21231122 will not be counted but 22113311122 will be. i.e. 123 or 321 or 312 or 213 or 132 or 231 should not be present in the number
distinct integers.Ex: 21231122 will not be counted but 22113311122 will be. i.e. 123 or321 or 312

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it