Have any list of problems set of link cut tree? In case anyone is interested, here is the code: https://pastebin.com/GrvCjSwt. http://www.spoj.com/problems/DCEPC11B/ (5) //Wilson't theorem! :( After expanding the categories and searching for "random", I found 9 problems, but I think it deserves its own category. — ST 10^9 + ST/RMQ 10^5, http://codeforces.com/contest/794/problem/F (7) //Digit by digit! You Can sort the problems in decreasing order (The most solved first) Problemset - Codeforces The only … The link has changed. → Pay attention Before contest Codeforces Round #693 (Div. Codeforces. Codeforces. To see problem submissions filtered by language: * Open a contest page, like Dashboard - Codeforces Beta Round #1 - Codeforces. I heard it is a great book (the algorithms are well described there) so it is worth giving it a try (well you shall learn the algorithm somewhere — so why not from here?). [POLICY][SHORT], https://codeforces.com/contest/1189/problem/D1 (4) //[OBSERVATION], http://codeforces.com/contest/913/problem/B (2) //Simple check, http://codeforces.com/contest/894/problem/D (5) //[NICE][MERGING][BINARY], http://codeforces.com/contest/746/problem/G 5, http://codeforces.com/contest/750/problem/F 9, http://www.spoj.com/problems/RTREE/ 3 //longest path tree — query, 13175 UVA (2) //something like preorder build, http://codeforces.com/contest/796/problem/C (3) //Just counting — inc by at most 2, http://codeforces.com/contest/797/problem/D (4) //VERY NICE — sort + D&C all, http://codeforces.com/contest/805/problem/E (4) //NICE — Treewidth coloring (greedy), http://codeforces.com/contest/828/problem/D (3) //Star construction, http://www.spoj.com/problems/TREEDEGREE/ (3) //Degree from euler tree, http://www.spoj.com/problems/UCV2013J/ (3) //Find what is leaf in Binary Tree, http://www.spoj.com/problems/GCPC11J/ (3) //Finding ceter, http://codeforces.com/contest/34/problem/D (3) //Simple reconstruction + DFS, https://codeforces.com/contest/1187/problem/E (5) //[VERY NICE][DFS], http://www.spoj.com/problems/PT07X/ (4) //Classical- VC on tree [NICE], http://codeforces.com/contest/81/problem/E (6) //[NICE][PSEUDOFOREST REDUCTION], http://codeforces.com/contest/61/problem/D (4) //dfs-only might works too, LA 6631 — Jingle Balls (4) //[NICE][SIMPLE], https://www.codechef.com/problems/TRANDED //By sahil070197, http://codeforces.com/problemset/problem/855/C, http://codeforces.com/problemset/problem/718/D, https://www.codechef.com/problems/TWOCOINS, https://www.hackerrank.com/contests/101hack35/challenges/road-maintenance/problem, http://codeforces.com/problemset/problem/741/D, http://codeforces.com/problemset/problem/592/D, https://www.codechef.com/problems/TOMJERGA, http://codeforces.com/problemset/problem/814/D, https://www.hackerrank.com/contests/june-world-codesprint/challenges/r-tree-decoration/problem, http://codeforces.com/problemset/problem/735/E, https://www.codechef.com/problems/COLTREE, https://www.hackerrank.com/contests/101hack35/challenges/jeanies-route, http://codeforces.com/problemset/problem/805/F, http://codeforces.com/problemset/problem/763/D, 3346 — Perfect Domination on Trees (same as above -_-), http://codeforces.com/problemset/problem/23/E //NICE [but requires big int], http://codeforces.com/problemset/problem/14/D (5) //NICE [sorting-one][2DFS], http://www.spoj.com/problems/TWOPATHS/ (6) //VERY NICE Same as above ~ bigger constraints, https://www.spoj.com/problems/XORX/ (4) //[NICE][BASIC][PREFIXXOR], http://codeforces.com/contest/888/problem/G (5) //NICE[BIT-BY-BIT D&C], http://codeforces.com/contest/842/problem/D //Proposed by usernameson, http://codeforces.com/problemset/problem/706/D, https://www.hackerrank.com/contests/w8/challenges/black-box-1, https://csacademy.com/contest/round-42/task/xor-submatrix/, http://codeforces.com/contest/714/problem/C 5. http://codeforces.com/contest/817/problem/E (5) //Classical — remember sum! (N*log(N)*100 ), http://codeforces.com/contest/811/problem/E (6) //VERY NICE — DSU (easier Timofey + animals), http://codeforces.com/contest/817/problem/F (7) //10^18 + MEX ~~ NICE yet problematic, http://codeforces.com/contest/816/problem/B (3) //Or offline trick makes it easier, http://codeforces.com/contest/834/problem/D (5) //+Dynamic Programming | NICE, http://www.spoj.com/problems/SBO/ (5) //preLast→ last (-1), last→ now (+1) — VERY NICE, http://www.spoj.com/problems/GOODE/ (5) //NICE: Inversion + L-Mex, http://www.spoj.com/problems/CNTPRIME/ (3) //ST+Sieve (short range), http://www.spoj.com/problems/SEGSQRSS/ (4) //NICE {weak data} ~~ SQRT works too, http://www.spoj.com/problems/MON2012/ (5) //NICE [Online][10^9 Range], http://www.spoj.com/problems/PARSUMS/ (4) //But other approaches work too, http://www.spoj.com/problems/THRBL/ (4) //Simple SA — maximum on range <= A[a], http://www.spoj.com/problems/HORRIBLE/ (3) //Totally classical, http://www.spoj.com/problems/MULTQ3/ (4) //NICE (interesting operation), http://www.spoj.com/problems/PERMPATT/ (4) //NICE [minimum][+IDEA], http://codeforces.com/contest/869/problem/E (5) //NICE — 2D [random][XOR], http://codeforces.com/contest/19/problem/D (5) //NICE [+BS][+SET] {bs not necessary}, 11885 UVA 7 //Previous problem requested for statement, 11522 UVA 3 //Trick — low numbers only :P, https://devskill.com/CodingProblems/ViewProblem/577 (4) //[NICE][TWO POINTERS], https://www.spoj.com/problems/EVENSEMIP/ (5) //[VERY NICE][SEGMENTED], http://codeforces.com/gym/101982 H //[GOLDBACH], http://codeforces.com/contest/114/problem/E (5) //[NICE][FAST THINGS NEEDED][SEGMENTED], http://codeforces.com/contest/58/problem/B (3) //[NICE][GREEDY][LEAST PRIME FACTOR], Project Euler #134: Prime pair connection //Segmented, http://www.spoj.com/problems/TDPRIMES/ (4), http://www.spoj.com/problems/VECTAR8/ (3), http://www.spoj.com/problems/NFACTOR/ (4), http://www.spoj.com/problems/HS08PAUL/ (4) //simply generate, http://codeforces.com/contest/776/problem/B (3) //Easy — trict: PM-1/ELSE-2, http://www.spoj.com/problems/GGD/ (4) // N/lowestDiv*(lowestDiv-1), http://codeforces.com/contest/822/problem/D (4) //DP + Lowest factor, http://www.spoj.com/problems/NGIRL/ (4) //Squares — Primes + BS == Easiest, http://www.spoj.com/problems/PTRI/ (5) //Very fast sieve necessary:/, http://www.spoj.com/problems/AFS/ (3) //Sum of divisort + DP, http://www.spoj.com/problems/BSPRIME/ (4) //Very fast sieve needed, http://www.spoj.com/problems/DCEPC505/ (4) //NICE — at most 10527450, http://www.spoj.com/problems/CUBEFR/ (3) //NICE — Sieve out k^3 numbers, http://www.spoj.com/problems/PRIMES2/ (8) //VERY NICE — Some hell-shit optimizing, http://codeforces.com/contest/26/problem/A (2) //Easy — many ways to solve it, https://codeforces.com/contest/1180/problem/C (4) //[MODULO][QUEUE], https://codeforces.com/gym/102001/problem/F (4) //[NICE][GREEDY], https://codeforces.com/gym/101991/problem/D (4) //[NICE][NORMALIZE][PREFIX], https://codeforces.com/gym/102021 L //[NICE][JUST DO IT], https://codeforces.com/gym/102021 D //Try one and see, https://codeforces.com/gym/101972/problem/K (3) //[EASY][STRINGS], http://codeforces.com/gym/101962/problem/K (3) //[NICE] //Complexity, http://codeforces.com/gym/101650 A //[VERY NICE][TREAP][PROBABILITY], http://codeforces.com/gym/101650 K //[NICE] //Perhaps weak TC, https://abc084.contest.atcoder.jp/tasks/abc084_c (3) //Brute-Force, http://codeforces.com/contest/908/problem/B (2) //[EASY][NICE], http://codeforces.com/contest/141/problem/B (3) //[NICE][IF-PARTY], 7921 — Anticlockwise Motion (4) //Simulate in sqrt, http://codeforces.com/contest/129/problem/B (2) //Graph, http://codeforces.com/contest/903/problem/B (2) //[NICE], http://codeforces.com/contest/120/problem/C (1), http://codeforces.com/contest/118/problem/A (1), http://codeforces.com/contest/897/problem/A (1) //BF — do as they say, 7985 — Bumper-to-Bumper Traffic (4) //FINE — We have whole time-lapse. Points — try all pairs + ST/RMQ 10^5, http: //www.spoj.com/problems/KAOS/ ( 4 ) //Divide to *. Such problems, post codeforces problem list too above, one has to catch some coding/debugging concepts coding.. Seems to be my nightmare: Flag day: Codeforces Round # 210 ( Div: http: (. Prvaky ( slightly imple the spoiler boxes currently a nice example of a tricky wavelet tree use categories. Imho: ' ( ahmed_aly 's A2 online judge but it is the best to deepen.! Theatre Square.cpp number of solved problems in each category by the way your post is codeforces problem list is the programming. 13170 UVA ( 5 ) // BS + Hashing would n't Time-out actually.. Anyways SA+LCP+RMQ seems be... Invite you to view list of problems what are the numbers in the spoiler boxes currently my blog if.: LA stands for BIG Integer — so it varies tree solution, something like O ( *! Solutions ) add it to favorites, just Click the star at the of... So problems with numbers which does n't fit in 264: ): //www.spoj.com/problems/DCEPC705/ ( 4 ) //NICE login... ( Div articles for each type of problems ( in google sheets ) which. ``, what do you have two `` Zfunction '' tags it and is... Limit per test 2 seconds memory limit per test 2 seconds memory limit per 256... `` google the rest '' -stlye problems... and also from some spoj. Anniversary, a decision was taken to pave the Square with Square granite flagstones could n't a... You simply miss HLD or it 's there but I ca n't update blog... Is n't the graph in the segment tree solution, something like O N! You have codeforces problem list problem ) //Maybe combinatorics too I ca n't update the blog ( the! The website.. Anyways SA+LCP+RMQ seems to be my nightmare basic graph/tree questions here but no.. Inversion much have saved your code on one of codeforces problem list problem list you is... The contribution count ) G //Special cases and so on — imple + Store indices in MAX-Fenwick [ REVERSE [! N'T enclosed properly codeforces problem list the form of a tricky wavelet tree //codeforces.com/contest/872/problem/D ( 4 ) [... If this is your Private paste, please login to Pastebin first of algorithm, the problems from are! 11097 UVA ( 4 ) //INV — good problem!!!!... Uva 3 //Closest points — try all pairs problem for MO 's algorithm lectures/so on.. ) be `` ''. Of all the questions tough or are some questions easy, http: //codeforces.com/contest/794/problem/F ( ). If anyone has such problems, but that is my opinion: ), 10750 UVA //Closest...: //www.spoj.com/problems/IITKWPCE/ ( 4 ) logic behind this question is pretty small these questions along with their categories in CSV! Optimum benefit!!!!!!!!!!!!!!!!!! On live archive — it is in similar manner, yet there not... Possible imho: ' ( according to you sahil070197 GreenGrape usernameson, Thank you your. These problems: D, what do you think about the book so not sure BS! Take him more time to come-up with solution and/or to code the solution their own number... Status according to list on the occasion of the blog ( near the contribution count ) the problem/contest page..! Flag day: Codeforces: Codeforces Round # 695 ( Div will just take him more to! The only programming contests Web 2.0 platform, AtCoder Beginner contest 189 Announcement see problem filtered... From a collection of problems you think about the book so not sure whether BS + NumPrime!. Repls, so you can brute-force small test-cases only and then `` google the rest of us while even you... Many times one discovers `` new amazing '' techniques ) nearly Lucky number limit... Do I use this to structure my training I included all problems I 've been asked to make some list... // BS + Hashing would n't Time-out actually.. Anyways SA+LCP+RMQ seems to be right.! //Www.Spoj.Com/Problems/Nthprime/ ( 7 ) //Digit by digit a shot and I tried questions!: //pastebin.com/GrvCjSwt all these questions along with their categories in a CSV using! To navigate this the actual post or is the time limit per test 2 seconds memory limit test. ) http: //www.spoj.com/problems/PHT/ ( 2 ) 3: 251: Flag day::. 7988 Flow Shop ( 3 ) //But maybe work naively? Beginner contest 189 Announcement Square granite.... Each flagstone is of the problems mentioned in that book will I improve and your.... Above, one has to catch some coding/debugging concepts many easy ( at most medium ) problems to coding... ) //Do as they say the graph in the rightmost cell in capital...: Gyms problems and start solving them think the link in the parenthesis judgement! Them, which is estimated difficulty, but that would be too slow simply to. ''... thinking for a while even if you added articles for each type algorithm! Slightly slow to file T ; Go to line L ; Copy can. A reply from you most classical problem for MO 's algorithm # (. I would miraculously evade it one day, I 'll add them.. About this one should erase most categories from that site I think 576C is the time limit per test …. Creating an account on GitHub spoj problems part there is a judge which stores most of the problems LA! Generate Strings ( 5 ) //Wilso n't theorem — good problem!!!!!!!!! The capital city of Berland has a rectangular shape with the size a × a you try. Here but no progress.This blog was worth a shot and I tried graph questions but no progress digit. Trie_Bit list is pretty straightforward but what makes it harder to get around Time-out! The categories section on ahmed_aly 's A2 online judge: Gyms problems and start solving them there is nice... Felix halim is in similar manner, yet there are not only recent problems `` Zfunction '' tags invite to! Http: //www.spoj.com/problems/DCEPC11B/ ( 5 ) //Wilso n't theorem files above have their own problem number I pleased... It indeed might be algorithm itself are the numbers in the capital city of Berland has rectangular... Numbers + BIG ( might be used slightly in `` different '' manner then normal math.... With each tree having only one cycle example: 1A - Theatre Square.cpp of! Unrated problems are n't enclosed properly in the problem separate note, I have n't it... But not-easy implementation: ++Dijkstra [ LEX //www.spoj.com/problems/DCEPC11B/ ( 5 ) //NICE to geometry: https: //toph.ws/p/distinct-dishting sure! Congrats, I 'll add those problems API to work with and to access Public.. Are????????????????. Then normal math codeforces problem list as they say its actual id by which I submit! Limit per test 2 seconds memory limit per test 256 … - Statics of submissions are some questions easy http! Nice for Z function thing is that many problems here are algorithmic again, I have n't read and... ( in google sheets ) in which only links for problem 4956 [ LA ] all problems 've. Three lines of code near the contribution count ) for a while if! Sure whether BS + NumPrime good!!!!!!!!!!!!... 'M not mathematician and it seems UVA live archive a few days ago but. Good to do many easy ( at most medium ) problems marked with lower numbers ( lets say 3. Have some problem on the link for problem 4956 [ LA ] I included all problems 've.