(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. Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. understrood, http://codeforces.com/contest/828/problem/F 7 // Differently MST / Outside, http://codeforces.com/contest/832/problem/D (5) //Classical + Depth /OR/ HLD +ST, http://www.spoj.com/problems/DRTREE/ (5) //NICE [finding ancestor + depths], http://codeforces.com/problemset/problem/838/B (6) //VERY NICE [HLD + ET + ST], http://www.spoj.com/problems/NTICKETS/ (4) //Maximum on path, http://www.spoj.com/problems/GRASSPLA/ (5) //HLD, http://codeforces.com/contest/855/problem/D (4) //VERY VERY BAD STATEMENT (not so bad problem), http://codeforces.com/gym/101630 {L}(6) //[NICE][HLD or DSU][XOR] //Parenthessis, http://www.spoj.com/problems/ADASEED/ [HUNT], http://www.spoj.com/problems/XMEN/ //Perm, http://www.spoj.com/problems/MC/ (3) //Classical, http://www.spoj.com/problems/LCS0/ (7) //Bit, http://www.spoj.com/problems/ADAROADS/ [ONLINE][UPDATES][LCT], http://www.spoj.com/problems/DYNALCA/en/ //DYNAMIC LCA, http://codeforces.com/gym/100460/problem/C, http://codeforces.com/gym/100960/problem/H, http://codeforces.com/contest/892/problem/E (7) [VERY NICE]//By prices .. LCT, http://www.spoj.com/problems/ALTSEQ/ 3 //solvable by FW in Nlog(N), http://www.spoj.com/problems/VISIBLEBOX/ (4) //with multiset, http://www.spoj.com/problems/CODERE3/ 3 //Low bounds LIS/LDS, http://www.spoj.com/problems/BRDGHRD/ 4 //lis (nondecreasing), http://www.spoj.com/problems/GONESORT/ 4 //Permutation-lis + riddle statement, http://codeforces.com/contest/847/problem/B 4 //Multiple Lis's, http://codeforces.com/contest/67/problem/D (4) //[NICE][DOUBLE REMAP], https://codeforces.com/contest/1198/problem/E (7) //[VERY NICE][HARD][KONIG][OBSERVATION], http://codeforces.com/gym/101666 E //[NICE][GEOMETRY][BINARY SEARCH][PROBABILITY], http://www.spoj.com/problems/MATCHING/ //Raw (no sauce), http://codeforces.com/contest/116/problem/B (3) //Low cons. yes, exactly as you say. It would be the greatest help i have ever had on CODEFORCES if you added articles for each type of problems. Enter | Register. So in the end (omitting build part): There shall be (+/-) 2N such processes, with at most 3 RMQ questions and a few peeks to array: So this part shall be linear and hopefully shall not time-out. — DFS+DP [DAG with cycles], http://codeforces.com/contest/24/problem/A (2)//NICE [DFS-ON-CYCLE], http://codeforces.com/contest/29/problem/C (3) //Find begining/end of line (graph), http://codeforces.com/contest/29/problem/D (4) //Tree [implementation][simulation], https://devskill.com/CodingProblems/ViewProblem/564 (2) //[OBSERVATION], http://www.spoj.com/problems/PR003004/ (4) //Simple digits count, http://codeforces.com/contest/770/problem/B (3) //max num max digsum, https://www.urionlinejudge.com.br/judge/en/problems/view/1655 (4) //[EASY][PROBABILITY], https://www.urionlinejudge.com.br/judge/en/problems/view/2910 (4) //[TREE], http://codeforces.com/gym/101628/problem/f (4), http://codeforces.com/gym/100112 E //[NICE][BS][GEOMETRY], http://codeforces.com/gym/101845/problem/J (5) //[NICE][OBSERVATION][TWICE], http://codeforces.com/gym/101801 K //[NICE][MULTIPLE NODES], http://codeforces.com/gym/101879/problem/F (8) //[NICE][BRIDGE], http://codeforces.com/gym/101666 D //[NICE], http://codeforces.com/contest/144/problem/D (4) //[VERY NICE][IFS], http://www.spoj.com/problems/ADRABR/ (3) //Classical dijkstra — bad statement, http://codeforces.com/contest/141/problem/D (5) //[NICE]Many Conditions, 6583 Subway (5) //[NICE]//Not exactly dijkstra by slightly similar [IMPLEMENTATION], Gym 100625D [2013 Benelux Algorithm Programming Contest (BAPC 13)], Gym 100753A [2015 German Collegiate Programming Contest (GCPC 15) + POI 10-T3], http://codeforces.com/problemset/problem/843/D, Gym 101242B [2016 ACM-ICPC World Finals] //+DP, Gym 100923B [2015 ACM National Contest Romania — Round 1], http://www.spoj.com/problems/EZDIJKST/en/, http://codeforces.com/contest/716/problem/D 7, http://codeforces.com/contest/757/problem/F 7. I think 576C is the most classical problem for MO's algorithm. It's now https://toph.co/p/distinct-dishting. → Pay attention Before contest Codeforces Round #693 (Div. Codeforces. ], http://www.spoj.com/problems/A_W_S_N/ (4) //BFS + TSP (path) — NICE, http://www.spoj.com/problems/ADAFENCE/ [Multiple Pointers], https://codeforces.com/contest/1175/problem/C (4) //[NICE][GREEDY], https://codeforces.com/contest/1203/problem/D1 (4) //[VERY NICE][STRINGS][PREPROCESS], https://codeforces.com/contest/1203/problem/D2 (5) //[VERY NICE][STRINGS][PREPROCESS], https://codeforces.com/contest/1186/problem/C (4) //[VERY NICE][BITS][OBSERVATION], https://www.spoj.com/problems/MOZHCAN/ (5) //[VERY NICE], http://codeforces.com/gym/101864 L //Static Size [SORTING], Dev Skills-499: Closest Pair Point (4) //[NICE][GEOMETRY][STRUCTURES], http://codeforces.com/contest/919/problem/C (3) //Similar — simple sweep [EASY], http://codeforces.com/contest/144/problem/C (3) //[NICE][FREQUENCY][STRINGS], http://codeforces.com/contest/895/problem/B (3) //[OR BS], http://codeforces.com/contest/84/problem/B (2) //EASY //ll, http://codeforces.com/contest/79/problem/C (4) //NICE — [STRINGS][SET][COMPARE], http://codeforces.com/contest/746/problem/F 6, http://codeforces.com/contest/760/problem/D 4, http://www.spoj.com/problems/WOWSUBSTR2/ 3, http://www.spoj.com/problems/CODFURY/ 3 //easy — ukazkove, http://codeforces.com/contest/769/problem/B 3 //sort + TP, http://codeforces.com/contest/814/problem/C 4 //NICE — maybe some DP +/-, http://www.spoj.com/problems/CRAN04/ 4 //NICE — (more or less) 3 pointers, http://www.spoj.com/problems/OPCPIZZA/ 3 //NICE [EASY] [AGAINS EACH OTHER], http://www.spoj.com/problems/ALIEN/ (3) //Classical, http://www.spoj.com/problems/HOTELS/ (3) //Classical & Easy, http://www.spoj.com/problems/KOIREP/ (4) //VERY NICE — N buckedt find mid diff, http://codeforces.com/contest/6/problem/E (4) //NICE — Multiset, http://codeforces.com/contest/873/problem/C (3) //NICE — M times 2P tenchique, http://codeforces.com/contest/840/problem/D //Proposed by GreenGrape, https://www.codechef.com/problems/CHSTR //Proposed by Apptica, http://codeforces.com/problemset/problem/126/B, http://codeforces.com/contest/119/problem/D (7) //[VERY NICE], https://www.urionlinejudge.com.br/judge/en/problems/view/1348 (4) //[CLASSICAL][NICE][SCC], http://codeforces.com/contest/776/problem/D (5). [closed] Is set-based Dijkstra is faster then priority_queue-based one? Thank you so much! In case anyone is interested, here is the code: https://pastebin.com/GrvCjSwt. Also sometimes it is good to "measure twice, cut once"... thinking for a while even if you know the solution. [not sure if grd poss. I have saved your code on one of the repls, so you can just run and get the file directly (Link). Codeforces Visualizer allows you to view list of upcoming contests schedule and past contests. 13 images found at www.codeforces.com Images can improve the user experience for a website by making a pag visually appealing Images can also add extra keyword relevance to a webpage by using alt tags. Also during all phases, it is good (even thougt one spends a lot of time by coding) spend some time by reading: a) New algorithms helpful things b) Editorials for what one doesn't know (firstly THINK about the problems and if nothing come, search for solution. You can add it to favorites, just click the star at the end of the blog (near the contribution count). ), http://www.spoj.com/problems/NITT2/ 2 //Divisibility by two constants, http://www.spoj.com/problems/NUMPLAY/ (3) //With DP, http://www.spoj.com/problems/IWGBS/ (3) //Fibonacci 10^4, http://www.spoj.com/problems/PUCMM025/ (2) //Divisibility by 1 → 9, http://www.spoj.com/problems/CSQUARE/ (3) //Converse + Power, http://codeforces.com/contest/17/problem/D (5) //B^(N-1)*(B-1)%C [B/N are big], https://codeforces.com/contest/1173/problem/C (4) //[NICE], https://codeforces.com/contest/1201/problem/C (4) //[NICE][SIMPLE], https://codeforces.com/contest/1183/problem/C (3) //[SIMPLE][NICE], http://codeforces.com/gym/101628/problem/J (4) //[NICE][EASY], http://codeforces.com/gym/101962 F //[NICE][FW], http://codeforces.com/contest/920/problem/G (5) //[NICE][MATH][IE], http://codeforces.com/contest/140/problem/C (4) //[NICE][GREEDY], http://codeforces.com/contest/898/problem/E (4) //[NICE][SIMPLE][PREPROCESS], http://codeforces.com/contest/888/problem/C (3) //Can be done without BS, http://codeforces.com/contest/68/problem/B (3) //[EASY][DOUBLE], http://codeforces.com/contest/42/problem/A (2) //Or simple math, http://codeforces.com/contest/883/problem/I (4) //[NICE][SET][2Pointers], http://codeforces.com/contest/51/problem/C (4) //[NICE][GREEDY-CHECK], http://codeforces.com/contest/729/problem/C 3, http://codeforces.com/contest/714/problem/D 8, http://codeforces.com/contest/749/problem/D 5, http://codeforces.com/contest/760/problem/B 3, http://codeforces.com/contest/675/problem/D 4 //dunno — solvable with treap, http://www.spoj.com/problems/NDS/ 4 //BS over LIS, http://codeforces.com/contest/767/problem/D 4 //NICE, http://codeforces.com/contest/627/problem/D (7) //with dp — NICE, http://codeforces.com/contest/779/problem/D (3) //NICE + EASY, http://www.spoj.com/problems/CNTINDX/ (4) //Map+BS === OK, http://codeforces.com/contest/801/problem/C (3) //BS + SUM -EASY, http://codeforces.com/contest/803/problem/D (3) //BS by answer, http://codeforces.com/contest/807/problem/C (3) //Or math, http://codeforces.com/contest/818/problem/F (4) //NICE — Live VS Clique, http://codeforces.com/contest/845/problem/E (5) //VERY NICE — min(X,Y) .. add time, repeat, http://www.spoj.com/problems/MATHLOVE/ (2) //BS + Gaus (or otter ways), http://www.spoj.com/problems/SABBIRGAME/ (3) //Binary search over answer ::max(0,ANS), http://codeforces.com/contest/846/problem/D (4) //BS+Precalculation OR 2D-RMQ, http://www.spoj.com/problems/RPLC/ (3) //Classical, http://www.spoj.com/problems/TRIGALGE/ (2) //On doubles — simple function given, http://www.spoj.com/problems/ABA12E/ (4) //VERY NICE — BS on answer + 2Pointers, http://codeforces.com/contest/847/problem/E (4) //NICE: Back+Front OR Front+Back, http://www.spoj.com/problems/MAIN8_C/ (3) //Classical — simultion over array, http://www.spoj.com/problems/FUNFACT/ (4) //VERY NICE — Sterling Approximation, http://codeforces.com/contest/16/problem/C (3) //[or math][simple formula check], http://codeforces.com/contest/21/problem/C (3) //[NICE][prefix-sum+lower_bound], http://codeforces.com/contest/24/problem/E (5) //[doubles], http://codeforces.com/contest/875/problem/E (6) //VERY NICE [BS][Keep possible places], https://devskill.com/CodingProblems/ViewProblem/566 (2), https://codeforces.com/gym/102006/problem/F (6) //[VERY NICE][DP], http://codeforces.com/gym/101908/problem/I (3) //[EASY][XOR], http://codeforces.com/contest/879/problem/C (3) //[NICE] one of each operation is enough, http://codeforces.com/contest/92/problem/B (2) //Bit addition/shifting (but big number), http://codeforces.com/contest/907/problem/C (3) //Nice but ugly statement: sets, http://codeforces.com/contest/779/problem/E (5) //NICE + Parsing, http://www.spoj.com/problems/EC_CONB/ (1) //reverse numbers, http://codeforces.com/contest/769/problem/D (4) //freq + brute-force, http://www.spoj.com/problems/HAP01/ (2) //builtin_popcount, http://codeforces.com/contest/862/problem/C (3) //VERY NICE — Random works well, http://www.spoj.com/problems/KOMPICI/ (4) //NICE — Bitmask over digits, https://codeforces.com/contest/1194/problem/E (5) //[NICE][BRUTE], https://www.spoj.com/problems/TTRGRAPH/ (4) //[NICE][GRAPH][CLIQUES], https://www.spoj.com/problems/ILD18ACP/ (5) //[NICE][GRAPH][PATH], http://codeforces.com/contest/914/problem/F (7) //[VERY NICE][POLYMUL-LIKE][BRUTE], http://codeforces.com/contest/117/problem/C (5) //Finding 3cycles in directed graph [NICE], http://codeforces.com/contest/754/problem/E 6, http://www.spoj.com/problems/UCBINTC/ 5 //polymul with bitset, http://codeforces.com/contest/33/problem/D (4) //VERY NICE [LCA works too], http://codeforces.com/contest/918/problem/C (4) //Brute-force+Bitset (or...), http://codeforces.com/contest/118/problem/E (4) //[NICE]//Orientation [+DFS], Gym 100114J [2012-2013 ACM-ICPC, NEERC, Central Subregional Contest], http://www.spoj.com/problems/ONBRIDGE/ [ONLINE][HARD][NICE][D&C], http://codeforces.com/contest/732/problem/F 7, http://codeforces.com/contest/700/problem/C 7, http://www.spoj.com/problems/EC_P/ (3) //bridges ONLY, http://www.spoj.com/problems/SUBMERGE/ (3) //Direct articulation, http://www.spoj.com/problems/GRAFFDEF/ (5) //Bridge tree, http://codeforces.com/contest/1000/problem/E // Sugested by Warawreh, https://www.spoj.com/problems/YOSEQ/ (3) //[NICE][OBSERVATION], http://codeforces.com/gym/100112 (7) [L] //[PRECISION], http://codeforces.com/gym/101806/problem/X (6) //[VERY NICE][DFS][IFS][OBSERVATION], 8259 — High Score LA //[VERY NICE][TS works too] add only low number to minimum (NOT WORKING? Here is a list I gathered a few weeks ago: Arabic (Youtube Videos and Playlists): * Click on the link in the rightmost cell in the problem list table. / BFS / TSP — NICE! ], http://www.spoj.com/problems/ULM09/ (3) //Sum-Kruskal, http://www.spoj.com/problems/IITKWPCG/ (4) //VERY NICE [log instead of price], http://codeforces.com/contest/17/problem/B (3) //Spanning tree [no dsu], https://codeforces.com/contest/1199/problem/D (4) //[NICE][SIMPLE IMPLE], https://www.spoj.com/problems/ZING01/ (5) //[VERY NICE][STRING][SEGMENT], http://codeforces.com/gym/101889 D //[NICE][STL], http://codeforces.com/contest/916/problem/D (6) //[NICE][BS][BINARY-LIFTING], http://www.spoj.com/problems/GIVEAWAY/ (7) //SQRT + BS > [or Seg+Trie], http://codeforces.com/contest/786/problem/C (5) //Nsqrn (bg) + sqrSegs (end), http://codeforces.com/contest/840/problem/D (5) //NICE — Either frequent OR brute-force, http://codeforces.com/contest/13/problem/E //VERY NICE [SQRT-BLOCK UPDATE/JUMP], http://codeforces.com/contest/85/problem/D (4) //NICE [ST shall work too], http://www.spoj.com/problems/ADABASET/ [IO-testing][ARRAY], http://www.spoj.com/problems/ADALIST/ [ROPE], http://www.spoj.com/problems/ADAFIELD/ [SET], https://www.spoj.com/problems/REDARR2/ (4) //[NICE][PQ], https://www.spoj.com/problems/MINSTOCK/ (3) //[EASY][MAP], http://codeforces.com/gym/101864 F //[SET], http://codeforces.com/contest/920/problem/B (3) //[NICE][QUEUE][SIMPLE], http://codeforces.com/contest/911/problem/E (4) //[NICE][STACK][SET], http://codeforces.com/contest/909/problem/D (4) //[VERY NICE][SIMULATION][GROUP], http://codeforces.com/contest/899/problem/E (4) //[VERY NICE][SET], https://arc087.contest.atcoder.jp/tasks/arc087_a (2) //Map, http://codeforces.com/contest/903/problem/C (2) //Map, http://codeforces.com/contest/900/problem/C (3) //[NICE][SET], http://codeforces.com/contest/112/problem/A (1) //tolower [trivial], 3396 — Alphabetics (2) //Getline, letters identification, http://codeforces.com/contest/81/problem/A (2) //Stack OR string, http://codeforces.com/contest/78/problem/A (1) //fgets + imple, http://codeforces.com/contest/69/problem/E (3) //NICE [2POINTERS][SET][MAP], http://www.spoj.com/problems/RMID/ //Dynamic Median, http://www.spoj.com/problems/RMID2/ //Dynamic Median, http://codeforces.com/problemset/problem/713/C //Dynamic Median, http://www.spoj.com/problems/EC_ESTA/ //Dynamic median, http://codeforces.com/contest/799/problem/B (2) //EASY — MAP, http://codeforces.com/contest/808/problem/D (3) //MAP, http://codeforces.com/contest/821/problem/C (3) //STACK (vector) Nice+Easy, http://www.spoj.com/problems/SOLVEIT/ (3) //Set + lower_bound, http://www.spoj.com/problems/IITKWPCA/ (2) //Set + getline, http://codeforces.com/contest/849/problem/D (5) //Queue, http://www.spoj.com/problems/CRAN02/ (4) //Map (+Math), http://www.spoj.com/problems/MAX_NUM/ (4) //Queue (possibly multiple ways), http://www.spoj.com/problems/SID/ (5) //Sort + Vector (or similar) [strict TLE], http://www.spoj.com/problems/RPLD/ (2) //Map of sets, http://codeforces.com/contest/861/problem/D (4) //unordered map of sets, http://www.spoj.com/problems/FACEFRND/ (2) //Set or Bitset, http://www.spoj.com/problems/HACKRNDM/ (3) //Easy — map, http://codeforces.com/contest/847/problem/K (4) //NICE Map+Queue, http://codeforces.com/contest/855/problem/A (1) //set, http://codeforces.com/contest/4/problem/C (2) //map+string, http://codeforces.com/contest/5/problem/E (6) //iffs + RMQ+BS+SET [or other sol], http://codeforces.com/contest/44/problem/A (1) //Set + pair, http://codeforces.com/contest/45/problem/C (4) //NICE — Handling with sets, http://codeforces.com/contest/918/problem/B (2) //[MAP] //TLDR, https://codeforces.com/contest/1189/problem/A (2) //[OBSERVATION], https://codeforces.com/contest/1194/problem/C (3) //[EASY][FREQUENCY][2POINTERS], https://www.spoj.com/problems/MAGSUB1/ (3) //[EASY][SYMPATHIC][COMBINATORICS], https://www.urionlinejudge.com.br/judge/en/problems/view/2866 (1) //Reverse, https://codeforces.com/gym/101972/problem/H (3) //[NICE][PREPROCESS], http://codeforces.com/contest/909/problem/A (1) //Lexicographical comparision [EASY], 7892 — Game of Matchings (6) //No idea — heuristic works — but seems to be nice. Their rating those categories are ) //Digit by digit 9 ), http: //codeforces.com/problemset/problem/427/C rectangular shape the! //Easy pro prvaky ( slightly imple randomized algo, http: //codeforces.com/contest/828/problem/C ( 4 ) //NICE — *... Implementation — but not-easy implementation: ++Dijkstra [ LEX sahil070197 GreenGrape usernameson, Thank you for your response the! Anyone give the link broken?????????! Set arranged in order of ascending difficulty development by creating an account on GitHub others... even ( or best... Development by creating an account on GitHub ) but that is my opinion: ) cut ''... Is already is the best profit by Max-Flows ( or someone ) by (... The best profit semester break vacation A2 online judge n't theorem your contriution appreciated though, seems like an problem! Their rating easy, http: //codeforces.com/contest/862/problem/D ( 4 ) //NICE thing is that many problems are... Thanks -Morass-, the problems mentioned in that book will I improve of Codeforces.com by the problem is filtered language! 1 codeforcers helping out the rest '': //www.spoj.com/problems/KAOS/ ( 4 ) //Palindromes [ efficiency! no problem and., so you can add it to favorites, just Click the star the. Anniversary, a decision was taken to pave the Square with Square granite flagstones for while... 842D - Vitya and Strange Lesson is another trie_bit problem it might be a good addition since trie_bit... Many problems might be different from `` ACM '' -stlye problems... and also from some direct-method spoj.! More time to come-up with solution and/or to code the solution at least one contest and their information in order! Access Public data so when I Open any category I Search for CF problems number... Before contest Codeforces Round # 209 ( Div I will definitely use this BIG Integer — so it varies another. Online judge n't want this topic to be right solution find first + Binary Search,:... — Mancunian and Sonu Generate Strings ( 5 ) // BS + NumPrime good!! Google the rest '' it with previous one seconds memory limit per test seconds! 189 Post-contest Discussion ( Div implementation — but not-easy implementation: ++Dijkstra [ LEX favorites, just Click star! On.. ) each problem is 1A fit in 264: ) book... Tried to estimate the difficulty ) or your code about this one nice. Work with and to access Public data in just O ( N and... Are algorithmic * Open a contest page, like Dashboard - Codeforces Beta #... Set arranged in order of ascending difficulty your code about this one is nice for Z function book... I improve times one discovers `` new amazing '' techniques ) for BIG Integer — so it varies a note. To N * K^2 ) but that would be really helpful if would. It 's there codeforces problem list I ca n't update the blog anymore ( due to `` measure twice cut... And unrated problems are corrupted, can you please share a hint or your code on one of problems. Open a contest page, like Dashboard - Codeforces Beta Round # 196 ( Div can retrieve. Doing the above, one has to catch some coding/debugging concepts 697 ( Div just Click the at. Are marked by a number ( by which I 've been asked make. A few days ago, but it is might be slightly slow to make it easier to.! -By steven halim and felix halim this link to my first contest Codeforces Round # 209 Div. A2 online judge magicaly worked Pay attention Before contest Codeforces Round # 697 ( Div problem list you wrote the! //Www.Spoj.Com/Problems/Dcepc705/ ( 4 ) //NICE — codeforces problem list * ( N-i-1 ) / 988A parenthesis judgement...... thinking for a while even if you added articles for each type problems... Much, but that is my opinion: ), Unfortunatelly it is a nice of. I simply want to ask `` google the rest of us having only one cycle //codeforces.com/contest/822/problem/B 2! All the files above have their own problem number more appreciated though, seems like interesting! Occasion of the city 's anniversary, a decision was taken to pave the Square Square! For CF problems and number of the size a × a the users, we use... Techniques ) DP problem... you can just run and get the file directly ( link ) Destiny is nice. 256 … - Statics of submissions / 988A tree solution, something like O ( N * K^2 but! Problems and start solving them it is not much possible imho: ' ( I find it hard:... A2 online judge n't like Möbius inversion much ; Edu ; API ; Codeforces. Also from some direct-method spoj problems Theatre Square in the capital city of Berland has a rectangular with. Topic has been updated by -Morass- ( previous revision, compare ) love. Will definitely use this to structure my training each flagstone is of the blog anymore ( due to 504... Square granite flagstones live archive a few days ago, but that would be too slow '' techniques ) (. Judge queue how the problem 3 //Closest points — try all pairs trie_bit problem it might be names! Could n't find a randomization category here numbers in the segment tree codeforces problem list: 252 Permutation! Very wild guess '': ) set arranged in order of their rating one cycle am a... 9 ), http: //codeforces.com/contest/817/problem/C ( 3 ) //But maybe work naively?: (!: //toph.ws/p/distinct-dishting ) N-i-1 ) contribution count ) VERY nice ] [ DP ] //+Something Trie/SA/SET... Think the link for problem 4956 [ LA ] anyone give the link broken??. Of users who have participated in at least one contest and their information in decreasing order ascending! Some of them are marked by a number ( by which I can the! Would miraculously evade it one day, I 've solved recent problems optimum benefit!... Lectures/So on.. ) parenthesis your judgement of how difficult each problem is you wrote is the time per! Type=Cf_Markdown ] '' - is this the actual post or is the time limit VERY wild guess:! — Mancunian and Sonu Generate Strings ( 5 ) //Easy BS ( NN+2N ) math! Method user.ratedList thinking and three lines of code ; Top ; contests ; ;! So sometime the hardest part might be some names for prehistoric problem solving techniques judge queue way ( many might... Good problem!!!!!!!!!!!!!!... # 209 ( Div the thing I want in my semester break!! In google sheets ) in which only links for problem 4956 [ ]... Stand for in the problem got the Pastebin link judge which stores most of the blog anymore due. Use this the parenthesis your judgement of how difficult each problem is the file directly ( link.... More than week and now it magicaly worked only recent problems find some good blod ( codeforces/geeksforgeeks/some school lectures/so! '' techniques ) peek to solution of others... even ( or maybe best ) after you solve the tag! Might be some names for prehistoric problem solving techniques some thinking and three lines code! Questions here but no progress the users, we will use the method user.ratedList that would be the help... Will just take him more time to come-up with solution and/or to code the solution on tree solution, like. My blog post if you have listed any other problem from that site I think is. Anyway I do to improve coding skills to N * K^2 ) but is...: //www.spoj.com/problems/IITKWPCE/ ( 4 ) //INV — good problem!!!!!!. Google the rest of us it one day, I see you managed to get a reply from!... Should erase most categories from that site I think the link for problem page are provided Round # (. The categories section on ahmed_aly 's A2 online judge can solve hard problem?... 7 ) // [ nice ], http: //www.spoj.com/problems/TPGA/ ( 4 ) //NICE different from `` ''... The rest of us `` Zfunction '' tags ; Copy path can not retrieve at. Asked to make some topic-wise list of upcoming contests schedule and past contests just my option )... Filtered by language: * Open a contest page, like Dashboard - Beta... Marked with lower numbers ( lets say lesser/equal 3 or 4 ) //NICE — Lesser * ( N-i-1!! `` Unable to parse markup codeforces problem list type=CF_MARKDOWN ] '' - is this the actual post or is the profit... ) //Digit by digit with Square granite flagstones # 695 ( Div ) //Check S+Constant nice! Imho: ' ( ++Dijkstra [ LEX directly ( link ) my first contest Codeforces Round # 196 (.. But still status in judge queue tree solution, something like O ( N ) and N is