][OBSERVATION][DFS], https://codeforces.com/contest/1180/problem/D (5) //[VERY NICE][OVSERVATION], https://codeforces.com/contest/1178/problem/D (4) //[VERY NICE][OBSERVATION][NUMBER THEORY], https://codeforces.com/contest/1187/problem/C (4) //[NICE][IMPLEMENTATION], http://codeforces.com/contest/922/problem/F (6) //[NICE][MATH][GREEDY], http://codeforces.com/contest/916/problem/C (3) //Graph construction, http://codeforces.com/contest/148/problem/B (3) //[SIMULATION](math or bs), http://codeforces.com/contest/909/problem/F (6) //[VERY NICE][BITS], http://codeforces.com/contest/141/problem/C (4) //[NICE][BRUTE-FORCE], http://codeforces.com/contest/907/problem/D (5) //[VERY NICE][RANDOM], http://codeforces.com/contest/124/problem/C (3) //[NICE][SIEVE], http://codeforces.com/contest/125/problem/C (4) //[NICE][C(N,2)], http://codeforces.com/contest/902/problem/C (4) //[NICE]//Tree isomorphism, http://codeforces.com/contest/112/problem/C (3) //[GREEDY]//Max + 1s, http://codeforces.com/contest/110/problem/B (2) //Easy modulo, http://codeforces.com/contest/894/problem/C (3) //[VERY NICE] //AiAiGCD, http://codeforces.com/contest/97/problem/B (4) //NICE — Walls in middles [D&C], http://codeforces.com/contest/85/problem/A (3) //MODULO / SHIFT, http://codeforces.com/contest/81/problem/D (3) //NICE — MAX(N/2) — even/odd, http://codeforces.com/contest/63/problem/D (3) //NICE[GO BY LINES][4 WAYS B/D ODD/EVEN], http://codeforces.com/contest/42/problem/C (4) //Constructive works too but random is fine :), http://codeforces.com/contest/43/problem/D (3) //NICE — Easy to see [implementation], http://codeforces.com/contest/53/problem/C (2) //EASY [B/E Alternate], http://codeforces.com/contest/877/problem/C (3) //NICE 3*Alternative, http://codeforces.com/contest/802/problem/H (6) //We can do "N+k" by adding a letter p+k*x+u+xx, http://codeforces.com/contest/12/problem/E (5) //g[i][j]=1+(i+j)%(N-1) [+/-], http://codeforces.com/contest/22/problem/C (4) //Start and then clique without v (+ random), http://codeforces.com/contest/26/problem/C (5) //make Even*Even: do by 2*2 fields, http://codeforces.com/contest/41/problem/E (4) //[NICE][CN/2,N/2], http://codeforces.com/contest/78/problem/B (2) //NICE — last 3 and then rest in modulo, http://codeforces.com/contest/109/problem/D (5) //[NICE][BACK-POINTERS][SIMULATION][SORT], https://codeforces.com/contest/1176/problem/E (4) //[NICE][CONSTRUCTIVE][TREE][TOPO], https://codeforces.com/contest/1186/problem/F (5) //[NICE][GREEDY][CONSTRUCTIVE], https://codeforces.com/contest/1189/problem/D2 (5) //[NICE][CONSTRUCTIVE], https://atcoder.jp/contests/agc035/tasks/agc035_b (4) //[NICE][DIRECTION], https://www.spoj.com/problems/CHUNK2/ (3) //[DFS][PRIMES], https://codeforces.com/gym/101981 K //[VERY NICE][IMPLE][TREE][SIMULATION], https://www.urionlinejudge.com.br/judge/en/problems/view/1621 (4) //[TREE][IMPLE], https://www.urionlinejudge.com.br/judge/en/problems/view/1610 (3) //[CYCLE], https://www.urionlinejudge.com.br/judge/en/problems/view/2911 (4) //[NICE][RULES][SIMPLE], https://codeforces.com/gym/102001/problem/K (4) //[VERY NICE], https://codeforces.com/gym/101972/problem/B (6) //[VERY NICE][TREE][STL], http://codeforces.com/gym/100112 K //[NICE][BS][COLORING], http://codeforces.com/gym/101962 D //[NICE] //Bitset shall work too, 4286 — Equilibrium Mobile LA //[VERY NICE][OBSERVATION][TREE][DP], http://codeforces.com/gym/101801 (4) [H] //[TREE][DP] //More dfss, https://www.urionlinejudge.com.br/judge/en/problems/view/2732 (3) //Easy flood, http://codeforces.com/contest/920/problem/E (5) //[NICE][DFS][SET] //Or clever random, http://codeforces.com/contest/915/problem/D (4) //[VERY NICE][CYCLES DETECTION (ORIENTED)], http://www.spoj.com/problems/CTTC/ (3) //[EASY][GRAPH-RECONSTRUCTION], http://codeforces.com/contest/901/problem/D (7) //Observations / Tree reduction, http://codeforces.com/contest/902/problem/B (3) //No dfs needed, http://codeforces.com/gym/101630 {C}(4) //[NICE][SCC], http://codeforces.com/gym/101620 {J}(4) //DFS + multiples of divisors, http://codeforces.com/contest/120/problem/F (3) //Width of tree, 7606 — Percolation (3) //Dfs on grid [EASY], http://codeforces.com/contest/116/problem/C (2) //[DEPTH], 8080 — Christmas Tree (3) //[SIMPLE][NICE]. It will just take him more time to come-up with solution and/or to code the solution. ), Unfortunatelly it is not much possible imho :'(. Secondly some problems fit to some people more — so it varies. (Sorry for bad english). I've been asked to make some topic-wise list of problems I've solved. http://www.spoj.com/problems/IITKWPCE/ (4) //Palindromes [efficiency!] yes, exactly as you say. nope it is not. Could you please explain your dp idea? - Show list of solved problems in each phase. + Store indices in MAX-Fenwick [REVERSE] [VERY NICE], http://www.spoj.com/problems/DCEPC705/ (4) //NICE! I tried all basic graph/tree questions here but no progress.This blog was worth a shot and i tried graph questions but no progress. - Change number of days of each phase. In that case, either report it or ignore it (unless they are in different topics, then it have reason :) ). http://www.spoj.com/problems/TPGA/ (4) //NICE — Lesser*(N-i-1)! Another thing is that many problems here are algorithmic. Programming competitions and contests, programming community. Can someone explain what is the solution for this problem? http://www.spoj.com/problems/LOOPEXP/ (4) //A000254/N! Codeforces. [closed] Is set-based Dijkstra is faster then priority_queue-based one? Anyway I don't claim it is the only way (many problems might have better/easier solutions). fox and snake codeforces. http://www.spoj.com/problems/NTHPRIME/ (7) // BS + NumPrime GOOD!! Use it wisely Codeforces. Sometime one just find he's "stupid" but many times one discovers "new amazing" techniques). Sort + Fenwick, http://www.spoj.com/problems/DCEPC206/ (3) //NICE & EASY, http://www.spoj.com/problems/KOPC12G/ (4) //N Fenwick trees, http://www.spoj.com/problems/TRIPINV/ (4) //2xFenwick (triples counting), http://codeforces.com/contest/597/problem/C (4) //[VERY NICE] 11*Fenwick, http://codeforces.com/contest/12/problem/D (4) //NICE [triplet-comparing][sort], https://www.spoj.com/problems/NARHIL/ // Sugested by ak07_, https://toph.co/p/play-the-lottery (7) //[VERY NICE][D&C][MODULAR], Gym 100960C [2015-2016 Petrozavodsk Winter Training Camp, Nizhny Novgorod SU Contest], https://www.codechef.com/problems/POLYEVAL, http://codeforces.com/contest/827/problem/E (8) //MAGIC, http://www.spoj.com/problems/MAXMATCH/ 5 //abc hamming, https://www.spoj.com/problems/DISGRAPH/ (5) //Stoer-Wagner [global], https://codeforces.com/gym/101981 I //[NICE], http://codeforces.com/gym/101982 E //[VERY NICE][GRID], http://codeforces.com/gym/101845/problem/F (4) //Basic, http://codeforces.com/gym/101908/problem/G (4) //[NICE][MATCHING][BS], http://www.spoj.com/problems/FASTFLOW/en/ //Raw (no sauce), http://codeforces.com/contest/78/problem/E (5) //NICE [Matching-like][+BFS], 4322 — Destroying the bus stations (Live Archive), 11380 — Down Went The Titanic (UVA) //Interesting grid problem, 6395 — Surely You Congest (LA) //VERY NICE [slightly advanced], http://codeforces.com/gym/100963 (Flame of Nucleus — F), 11167 — Monkeys in the Emei Mountain //Also harder (imho), http://codeforces.com/problemset/problem/653/D (+BS), https://www.deadline24.pl/assets/problemsets/dl24.elim.2017.B.en.pdf (DEADLINE 24 problem — not sure if it can be submited :O), http://codeforces.com/problemset/problem/727/D, http://codeforces.com/problemset/problem/704/D [Also advanced], 4957 — Fake scoreboard (LA) //If I remember well, other solutions was also possible, 1155 — Power Transmission (LOJ) //(classical), https://www.codechef.com/problems/ROBOTDAG //Ford-Fukherson, 11506 — Angry Programmer (UVA) //Nodes division, 10092 — The Problem with the Problem Setter, Problem B. Roller Coaster Scheduling (GCJ — 2017), 5905 — Pool construction (LA) //Imho harder, http://codeforces.com/contest/808/problem/F 6 //NICE — nontrivial (max matching with bigger flows), http://codeforces.com/contest/847/problem/J 6 //Probably not flows — matching-like, http://www.spoj.com/problems/ADAHOSE/ [DUAL-GRAPH], http://codeforces.com/contest/903/problem/G (6) //[VERY NICE][SEG-TREE][CUT], http://www.spoj.com/problems/ADABLOOM/ //Maximum matching in general graph, 11439 — Maximizing the ICPC //Maximum matching in general graph, 1376 — Animal Run //Max flow on planar graph (Dual == shortest path over edges), 10989 — Bomb, Divide and Conquer //Stoer-Wagner — global cut, https://codeforces.com/contest/1202/problem/B (3) //[VERY NICE], http://codeforces.com/gym/101845/problem/C, https://www.urionlinejudge.com.br/judge/en/problems/view/2676 (3) //simple FW, http://codeforces.com/problemset/problem/21/D, http://www.spoj.com/problems/INGRED/ //+DP, Gym 101223C [2017 Facebook Hacker Cup, Round 1] //+DP, http://www.spoj.com/problems/ARBITRAG/ //Other algos shall work too, http://www.spoj.com/problems/ROHAAN/ (3) //Classical, http://codeforces.com/contest/25/problem/C (4) //Adding new edges .. need FW principal, http://codeforces.com/contest/33/problem/B (3) //NICE [dijkstra could work too], http://www.spoj.com/problems/ADAGAME/ [DP], https://codeforces.com/contest/1194/problem/D (4) //[OBSERVATIO][PATTERN], https://codeforces.com/contest/1191/problem/E (4) //[NICE][IF][OBSERVATION], https://www.spoj.com/problems/HUSGAME/ (4) //[VERY NICE][OBSERVATION][RECURSION], https://www.spoj.com/problems/IBIGAME/ (5) //[VERY NICE][OBSERVATION][DP], https://codeforces.com/gym/102058/problem/F (4) //[NICE], http://codeforces.com/gym/101801 F //[EASY][OBSERVATION][NIM], http://codeforces.com/gym/101908/problem/B (5) //[NICE][NIMBERS][OBSERVATION], http://codeforces.com/gym/101873 H //[VERY NICE][OBSERVATION][TREE] //LUP LUP, http://codeforces.com/gym/101808/problem/I (5) //[DP][OBSERVATION], http://codeforces.com/contest/919/problem/F (6) //[NICE][HARD][IMPLE][BFS][TOPO][GRAF], http://codeforces.com/contest/918/problem/D (4) //[NICE][DAG][DP][TREE], http://codeforces.com/contest/914/problem/B (3) //[NICE][EASY][OBSERVATION][PARITY], http://codeforces.com/contest/148/problem/D (4) //[EASY][DP][PROBABILITY], http://codeforces.com/contest/138/problem/D (7) //[VERY NICE][DP][OBSERVATION], https://arc087.contest.atcoder.jp/tasks/arc087_c (5) //[VERY NICE][TRIE][SEQUENCE], http://codeforces.com/contest/120/problem/E (3) //[NICE][SYMETRY][PARITY], http://codeforces.com/contest/88/problem/E (5) //[VERY NICE][PREFIX-XOR][NIMBERS][SQRT][MATH], http://codeforces.com/contest/69/problem/D (4) //[NICE][DP] Reflection can be ignored, http://codeforces.com/contest/55/problem/C (4) //[NICE] Size of piece from border, http://codeforces.com/problemset/problem/255/E --MEX, https://devskill.com/CodingProblems/ViewProblem/91, https://devskill.com/CodingProblems/ViewProblem/364, http://www.spoj.com/problems/VECTAR11/ 4 //Nsqrt(N) passes [with break], http://codeforces.com/contest/768/problem/E (4) //NICE — Grundy, http://www.spoj.com/problems/SYNC13C/ (4) //2*DP {maybe not seeing sth}, http://codeforces.com/contest/787/problem/C (4), http://codeforces.com/contest/794/problem/C (3) //Find optimal strategy: choose back/front, http://codeforces.com/contest/794/problem/E (5) //NICE Find stategy: Even/Odd, http://codeforces.com/contest/812/problem/E (7) //Advanced NIM strategy, http://www.spoj.com/problems/GAMEMVS/ (4) //Nimbers (Ai^X)<=Ai, http://www.spoj.com/problems/PLAYGAME/ (3) //Check pattern, http://www.spoj.com/problems/CHAOS_CC/ (4) //VERY NICE [nimbers], http://codeforces.com/contest/851/problem/E (5) //Very nice [nimbers] [bitset], http://www.spoj.com/problems/CHGROOM/ (4) //+Factorisation [NICE & Easy]: Win unless 2 prime factors, http://www.spoj.com/problems/EALP1/ (4) //NICE ~ Possible Moves of NIM, http://www.spoj.com/problems/GAME3/ (4) //VERY NICE — pattern watching [A145812], http://www.spoj.com/problems/GAME2/ (5) //VERY NICE — https://community.topcoder.com/tc?module=Static&d1=match_editorials&d2=srm338 (CAKE), http://www.spoj.com/problems/CF36D/ (5) //Pattern watching (care for 1), http://codeforces.com/contest/15/problem/C (4) //VERY NICE [XOR: A,1,A+1,0..repeat], http://codeforces.com/contest/39/problem/E (4) //Slightly [DP][MATH][ROUNDING], http://codeforces.com/contest/63/problem/E (5) //[NICE][BITMASK-DP], http://codeforces.com/gym/100923/problem/C, Gym 100962A [2015-2016 Petrozavodsk Winter Training Camp, Moscow SU Trinity Contest][NICE], https://codeforces.com/contest/1199/problem/B (2) //[NICE][SIMPLE], https://codeforces.com/gym/101991/problem/J (5), https://codeforces.com/gym/101991/problem/B (4), https://codeforces.com/gym/102006/problem/I (4) //[VERY NICE][ITERATIVE], https://codeforces.com/gym/102021 G //[3D], https://codeforces.com/gym/102021 B //Path on circle, https://codeforces.com/gym/102058/problem/K (3) //[BRUTE-FORCE][FAIL], https://codeforces.com/gym/101972/problem/C (4) //[EASY][POINTS DISTANCE][IMAGE], http://codeforces.com/gym/101628/problem/C (4) //Circles intersection. I submitted some problems on live archive a few days ago, but still status in judge queue. Again, I haven't read it and this is just my option :), This one is nice for Z function . http://www.spoj.com/problems/GCDEX/ (7) //OEIS A006579 — enough [well imp], http://www.spoj.com/problems/APS/ (3) //just sieve + generate, http://www.spoj.com/problems/WPC5I/ (3)//fc: C[a]!=C[b]:F[a]^max(C[a],C[b]), http://www.spoj.com/problems/SPEC_SET/ N→N/k→N/k/k. -Morass- Can You say the total numbers (digit) :p of the problem listed here :D :D, Hey Anyone Help me with STL very first problem [ADABASET]-(https://www.spoj.com/problems/ADABASET/en/). Even though many people undeestimate this, it is very important to get to phase where you can code what you know (well, it might sound stupid, but many times one know a solution one hour before end of contest, yet he ends coding 10 minutes before end when he starts his 20 minute debugging phase [and both could be significantly reduced]). I guess while asking such question you expect to find answer in form "Here is the list, learn everything from it and you'll ace every single div2 contest". 13170 UVA (7) //heavy implementation — but NICE! It's my pleasure to get a reply from you! It returns the list of users who have participated in at least one contest and their information in decreasing order of their rating. ), 10750 UVA 3 //Closest points — try all pairs. This is a really helpful article . You Can sort the problems in decreasing order (The most solved first) Problemset - Codeforces Or if anyone know any source? 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?). If I remember some of them I'll add them here. 2) 3: 253: Levko and Permutation: Codeforces: Codeforces Round #210 (Div. About. http://www.spoj.com/problems/DCEPC11B/ (5) //Wilson't theorem! Programming competitions and contests, programming community. If there is non-positive, you need to move two negatives to the list of positives, because the product of two negatives is positive. It also helps you to manage and track your programming comepetions training for you and your friends. 2) 3: 254: Dima and To-do List: Codeforces ), https://www.spoj.com/problems/OVISLARSUM/ (3) //[FORMULA][128], https://www.urionlinejudge.com.br/judge/en/problems/view/2876 (6) //[VERY NICE][GCD][IE], https://codeforces.com/gym/102058/problem/E (3) //[BRUTE-FORCE][GCD], https://codeforces.com/gym/101972/problem/A (3) //[EASY][SIMULATION], https://www.codechef.com/viewsolution/21428053 (4) //[SORTING][ANGLES][MATH][COSINUS], http://codeforces.com/gym/101808/problem/G (4) //[GCD][IF][LCM], http://codeforces.com/gym/101666 L //[GREED][DP] Logarithms, http://codeforces.com/gym/101666 C //[NICE][GCD], http://codeforces.com/gym/101650 G //Graphs, http://codeforces.com/contest/934/problem/D (4) //Polynomials, http://codeforces.com/contest/919/problem/E (5) //[MODULAR-MATH], http://codeforces.com/contest/149/problem/B (3) //Base to 10, http://codeforces.com/contest/148/problem/A (2) //[EASY][SIEVE][BRUTE-FOCE][LCM][IE], http://www.spoj.com/problems/JGTLE/ (3) //Sum reduction, http://www.spoj.com/problems/BAPM/ (3) //Simple power / Observe, rare colisions, http://codeforces.com/contest/911/problem/C (2) //[Observation][Iff (or brute-froce)], http://codeforces.com/contest/133/problem/B (2) //Bases + implementation, http://codeforces.com/contest/129/problem/A (1) //Parity, http://codeforces.com/contest/124/problem/D (4), http://codeforces.com/contest/125/problem/A (1) //mod/div simple — if, http://codeforces.com/contest/902/problem/D (4) //Polynomials / Fibonacci / Bitset, http://codeforces.com/contest/899/problem/D (4) //X99999 possibilities, http://codeforces.com/contest/899/problem/C (3) //[NICE][GREEDY KNAPSACK], http://codeforces.com/contest/899/problem/A (1), http://codeforces.com/contest/898/problem/A (1), http://codeforces.com/gym/101620 {F}(4) //[IFS][INVERSE][CASES], http://codeforces.com/contest/900/problem/D (4) //[NICE][DIVISORS][GCD][IE], http://codeforces.com/contest/900/problem/B (2) //Cycles or Brute-force + Division, http://codeforces.com/contest/119/problem/A (2) //[EASY][GCD], 8014 — Birthday Pizza Party (4) //[NICE][OVERFLOW][LCM WITH SHIFT], 7629 — Powers (3) //One path is factorisation, 8037 — Military Service (2) //Sample formula, 8085 — Divisors (4) //[NICE][PRIMES/FACTORISATION/SIEVE], 6589 — Captain Obvious and the Rabbit-Man (7) //Sylvester's formula, 6582 — Magical GCD (4) //[NICE] — Data structures works too, https://devskill.com/CodingProblems/ViewProblem/421 (2) //6 buckets, http://codeforces.com/contest/93/problem/E (5) //[VERY NICE][DP][RECURSION], http://codeforces.com/contest/86/problem/A (3) //[NICE] 50* is best (unless more digits), http://codeforces.com/contest/83/problem/D (5) //[VERY NICE][PRIMES][BRUTE-FORE-2], http://codeforces.com/contest/82/problem/A (2) //Simulation, http://codeforces.com/contest/74/problem/C (4) //gcd, http://codeforces.com/contest/76/problem/E (4) //Divide sumations [BF], http://codeforces.com/contest/71/problem/C (3) //[EASY][NICE][BRUTE-FORCE][DIVISORS], http://codeforces.com/contest/70/problem/A (2) //3^(N-1), http://codeforces.com/contest/43/problem/C (2) //Moduly by 3 {0/2+min(1,2)}, http://codeforces.com/contest/50/problem/A (1) //[EASY], http://codeforces.com/contest/61/problem/C (4) //Base conversion + roman, https://www.codechef.com/problems/COPRIME3 //Cyka Möbius, http://www.spoj.com/problems/PSTR/ //Cyka Möbius, http://codeforces.com/problemset/problem/803/F //Cyka Möbius, https://devskill.com/CodingProblems/ViewProblem/23, http://codeforces.com/contest/731/problem/F 4, http://codeforces.com/contest/722/problem/F (8), http://codeforces.com/contest/716/problem/C 4, http://codeforces.com/contest/711/problem/E (8), http://codeforces.com/contest/710/problem/D (6), http://codeforces.com/contest/757/problem/E (8), http://codeforces.com/contest/758/problem/F (7), 11237 UVA (4) //Nice — seems like knapsbag but it it not, 11155 UVA (4) //Almost as previous problem, 11038 UVA (3) //counting digits on interval, http://codeforces.com/contest/763/problem/C (7), 11087 UVA (4) //Sums of two numbers divisible with <=500 (10^5), http://codeforces.com/contest/678/problem/C 2 //LCM, http://codeforces.com/problemset/problem/665/F (8) //p^3 | p*q, http://www.spoj.com/problems/LCMSUM/ //Vzorec v knihovničce, http://www.spoj.com/problems/FRNDZND/ (2) // (size 1 == 1, else 0), http://www.spoj.com/problems/EXPOR/ //bit-by-bit (+ formula), http://www.spoj.com/problems/FACTDIV/ (5) //dyn-update of ans/factors GOOD, http://www.spoj.com/problems/PAIRDIV/ (6) //cyka möbius -_-, http://www.spoj.com/problems/FCDC/ (4) //keep factorized factorial. Pretty neat. https://www.codechef.com/problems/CHEFNUMK, https://www.hackerearth.com/problem/algorithm/harry-gets-into-infy-1/description/, http://www.spoj.com/problems/COT/ (7) //ON TREE [but very tight TLE], http://www.spoj.com/problems/GOT/ (5) //ON TREE, http://www.spoj.com/problems/CPAIR2/ (4) //MO + Fenwick [VERY NICE], http://www.spoj.com/problems/HRSIAM/ (5) //With updates, http://www.spoj.com/problems/KDOMINO/ (4) //NICE — Frequencies, https://codeforces.com/contest/1187/problem/B (3) //[NICE], 13257 — License Plates UVA //Brute-Force 26^3 queries in O(1), http://codeforces.com/contest/92/problem/C (3) //[VERY NICE], https://www.codechef.com/problems/ASTRING, http://codeforces.com/problemset/problem/701/C, http://www.spoj.com/problems/STRSEQ/ //+DP, http://codeforces.com/problemset/problem/762/C, http://codeforces.com/problemset/problem/724/D, http://www.spoj.com/problems/SUBSN/ //+BS, https://www.hackerrank.com/contests/world-codesprint-5/challenges/short-palindrome //+DP, http://codeforces.com/gym/101908/problem/J (6) //[VERY NICE][STEINER][GEOMETRY], http://codeforces.com/gym/101666 G //[NICE][BURTE FORCE][OBSERVATION][SUBSETS], http://codeforces.com/contest/907/problem/E (5) //[VERY NICE][CLIQUE][DP], http://codeforces.com/contest/114/problem/B (3) //[CLIQUE][BRUTE-FORCE], http://www.spoj.com/problems/JOHNNY/ //Not exact — points, http://www.spoj.com/problems/TAKIN/ (3) //[KNAPSACK][RECURSION], http://codeforces.com/contest/839/problem/E (5) //NICE! ), http://www.spoj.com/problems/BEHAPPY/ (2) //Easy one — low constraints, http://www.spoj.com/problems/STRCOUNT/ (4) //No input (over bits), http://codeforces.com/contest/855/problem/B (2) //prolly not even necessary, http://codeforces.com/contest/855/problem/C (4) //dp on tree, http://codeforces.com/contest/855/problem/E (5) //VERY NICE — Digits & Bitmask & Query (learning! http://www.spoj.com/problems/AMR10J/. Solutions of CodeFroces problems. It seems UVa live archive have some problem on the website. Codeforces. Codeforces. I'm not mathematician and it seems slightly like magic to me :'( I find it hard somehow :/. — Clique-DAG + inversion, http://codeforces.com/contest/798/problem/C (4) //GCD == at the beginning OR 2, http://codeforces.com/contest/803/problem/C (3) //Only "low" K and just divisors, 10830 (4) //simple add 2→ sqrt(N) + their mirrors, http://codeforces.com/contest/817/problem/A (2) //check division + parity, 13209 UVA (3) //Simple simulation of division (+states rememberance), http://codeforces.com/contest/834/problem/C (4) //Has cube-root + both num divisible by cuberoot, http://codeforces.com/contest/837/problem/E (5) //Factorisation + GCD attributes, http://www.spoj.com/problems/SUMMATION/ (3) //Number contribution: 2^(N-1), http://www.spoj.com/problems/SECTORS/ (4) //Odd len OR sum of odd indices == sum of even, http://www.spoj.com/problems/IITKWPCM/ (6) //VERY NICE — Gauss's generalisation of Wilsons Theorem, http://www.spoj.com/problems/UCV2013A/ (4) //N*(N^L-1)/(N-1), http://www.spoj.com/problems/KIMO1/ (4) //NICE — Adding/Subing by modulus, http://www.spoj.com/problems/AFS2/ (4) //Sum of divisort (sqrt(N)) — (+128int), http://www.spoj.com/problems/FUNNUMS/ (4) //Permutations (get ith + guess ith), http://www.spoj.com/problems/MAY99_3/ (3) //GCD, http://www.spoj.com/problems/PUCMM334/ (3) //Classical hats problem, http://www.spoj.com/problems/LCPC11B/ (4) //Factorize + count all subsets, http://www.spoj.com/problems/THREENUMBERS/ (2) //EASY & NICE [lcm], http://www.spoj.com/problems/GAMES/ (2) //EASY&NICE — Go discrete (by 10^k) → 10^k/GCD, http://www.spoj.com/problems/SUBSHARD/ (4) //dig*10^sufix*(choose sufix)*^Prefix [VERY NICE], http://www.spoj.com/problems/INVDIV/ (6) //Sum of divisors function + factorisation [NICE], http://www.spoj.com/problems/JNEXT/ (2) //EASY — Zahřívačka pro prváky, http://www.spoj.com/problems/TSHOW1/ (3) //NICE — Almost as binary repre with 5/6, http://codeforces.com/contest/859/problem/B (2) //Easy by iteration, http://codeforces.com/contest/861/problem/A (2) //5,2 division [EASY], http://www.spoj.com/problems/ABA12D/ (4) //NICE — Formula for sum divisors Prod(Sum(fac-powers)), http://www.spoj.com/problems/MAIN74/ (3) //Fibo's, http://www.spoj.com/problems/NOSQ/ (3) //Sieve + Digit check, http://www.spoj.com/problems/SQUAREV1/ (3) //NICE (but dumb code limit), http://codeforces.com/contest/597/problem/A (1) //Simple if+2*Divide, http://www.spoj.com/problems/STREETR/ (3) //Easy [GCD], http://www.spoj.com/problems/HPYNOSII/ (3) //<=1000 after first move, http://www.spoj.com/problems/HPYNOS/ (1) //Same as above — 1 number, http://www.spoj.com/problems/IITD4/ (3) //Brute-force [sieve-like], http://www.spoj.com/problems/GIRLSNBS/ (2) //Some easy formula, http://www.spoj.com/problems/GUESSTHE/ (2) //NICE [EASY][LCM], http://codeforces.com/contest/867/problem/B (2) //NICE [observation][1 2], http://www.spoj.com/problems/NDIVPHI/ (4) //NICE — Multiple of lowest primes [BIG-INT], http://www.spoj.com/problems/NDIVPHI2/ (5) //NICE — Same as above [bigger constraints], http://codeforces.com/contest/6/problem/A (1) //Triangle check (4 pts), http://codeforces.com/contest/869/problem/B (1) //Answer is usually 0, http://codeforces.com/contest/9/problem/C (2) //Bases (2→ 10), http://codeforces.com/contest/20/problem/B (2) //Ax^2+Bx+C=0 (find roots), http://codeforces.com/contest/27/problem/E (5) //[VERY NICE]: Factorisation+Recursion, http://codeforces.com/contest/32/problem/C (3) //DSU works too, http://codeforces.com/contest/872/problem/C (3) //NICE — Compose of 4 (mby one 6 or 9), http://codeforces.com/contest/876/problem/B (3) //Group by modulo, http://www.spoj.com/problems/ADABANKET/ //Observation (but Stoer-Wagner works too), https://codeforces.com/contest/1194/problem/A (1) //[TRIVIAL], https://www.spoj.com/problems/ARRTWIST/ (3), https://www.spoj.com/problems/OPMODULO/ (3) //[NICE]Brute-force and observe, https://codeforces.com/gym/102001/problem/I (2) //[PARITY], https://codeforces.com/gym/102001/problem/A (4) //[VERY NICE][FREQUENCY], https://codeforces.com/gym/101991/problem/L (3) //[NICE][EASY][BITS], https://codeforces.com/gym/102021 F //[NICE][SEQENCE], https://www.codechef.com/problems/BUDDYNIM (3) //[OBSERVATION][NICE], http://codeforces.com/gym/101962/problem/H (4) //[SEQUENCES][SIMULATION], http://codeforces.com/contest/922/problem/C (3) //Note that K is always very low, http://codeforces.com/contest/912/problem/B (2) //Bits/XOR, http://codeforces.com/contest/911/problem/D (3) //[VERY NICE], http://codeforces.com/contest/902/problem/E (5) //[VERY NICE] //LCT works too, 7589 Rearranging a Sequence (3) //Print from back and then real, http://codeforces.com/gym/101630 {A}(6) //[NICE][STL], http://codeforces.com/contest/122/problem/B (1) //just 4 or 7, http://codeforces.com/contest/116/problem/E (6) //[NICE][COMBINATORICS][FIND ANY], http://codeforces.com/contest/892/problem/D (4) //NICE [SORTING], http://codeforces.com/contest/897/problem/E (5) //[NICE][SET] //2 will beat all, 7730 To begin or not to begin (3) //Parity, http://codeforces.com/contest/122/problem/D (4) //[NICE] Sweep /OR/ cycle, http://codeforces.com/contest/128/problem/D (6) //Normalize + Sweeps, https://codeforces.com/gym/101981 G //A000332, https://codeforces.com/gym/102001/problem/C //De Bruine, http://www.spoj.com/problems/VECTAR5/ 3 //https://oeis.org/A038721, http://www.spoj.com/problems/ESYRCRTN/ 2 //generate and see, http://www.spoj.com/problems/IITWPC4B/ 3 //http://oeis.org/A005044, http://www.spoj.com/problems/POLCONST/ (4) //A003401+Fermat Number (Prime), http://www.spoj.com/problems/CUTCAKE/ (3) // pattern [1 22 333 4444 55555], http://www.spoj.com/problems/LOVINGPW/ (3) //A000788, http://www.spoj.com/problems/CBANK/ (3) //A000292 Tetrahedral numbers, http://www.spoj.com/problems/GUMATH2/ (4) //A000240 Modulo by MOD*2, http://www.spoj.com/problems/MATHII/ (4) //A006218 (Two formulas => sqrt(N)), http://www.spoj.com/problems/KOPC12B/ (4) //A002457 (factorial + factorial modular), http://www.spoj.com/problems/YUMMY/ (4) //A006534, http://www.spoj.com/problems/ADV04B1/ (5) //A001850, http://www.spoj.com/problems/FLWRS/ (4) //A002464, http://www.spoj.com/problems/RANJAN02/ (3) //A024023, http://www.spoj.com/problems/BOMARBLE/ (2) //A000326, http://codeforces.com/contest/57/problem/C (4) //A045992, http://codeforces.com/contest/918/problem/A (1) //Fibo, https://www.spoj.com/problems/CLFLARR/ (3) //[NICE][EASY][QUEUE][STL], https://codeforces.com/gym/102021 M //[VERY NICE][SPANNING]//LCA WORKS TOO, http://codeforces.com/gym/101840 I //[NICE][PREPROCESS], http://codeforces.com/problemset/problem/816/B //Easier ST, 11266 UVA (6) //slightly knapsack || [NICE], http://codeforces.com/contest/761/problem/F (7), http://www.spoj.com/problems/UPDATEIT/ (2) //basic method, 13189 UVA (4) //simulation + sort queries, http://www.spoj.com/problems/HAYBALE/ (3) //Basic sum + sort (segment tree would work too), http://codeforces.com/gym/101597/problem/H (6) //Offline 2D sum + geometry, https://www.spoj.com/problems/JUSTAPAL/ (6) //[VERY NICE][SA][RMQ], https://www.spoj.com/problems/DRAGKING/ (4) //[CLASSICAL][DP], https://codeforces.com/gym/101981 (5) //[NICE][SEGMENT][MANACHER][ZETA][SA], https://codeforces.com/gym/101972/problem/F (3) //[EASY][OBSERVATION][GREEDY], http://codeforces.com/gym/101628/problem/E (4) //[NICE][DP] //Easy, http://codeforces.com/gym/101864 J //[NICE][MANACHER], http://codeforces.com/gym/101806/problem/Q (4) //[HASHING][PALINDROMIC-TREE], http://codeforces.com/contest/897/problem/B (2) //Palindromic numbers [EASY][FIRST], http://codeforces.com/contest/883/problem/H (3) //Make as least odd as possible, http://code-festival-2017-qualc.contest.atcoder.jp/tasks/code_festival_2017_qualc_c (3) //Similar to remove-dp, but greedy, http://code-festival-2017-qualc.contest.atcoder.jp/tasks/code_festival_2017_qualc_d (4) //DP with greedy thinking, http://codeforces.com/contest/59/problem/C (3) //Implementation [constructive], http://www.spoj.com/problems/MSUBSTR/ //manacher, https://www.hackerrank.com/contests/101hack35/challenges/circular-palindromes //manacher, https://www.hackerrank.com/contests/world-codesprint-5/challenges/challenging-palindromes //SA, http://www.spoj.com/problems/NUMOFPAL/ //Palindromic Tree, http://codeforces.com/problemset/problem/245/H //# of palindromes [DP], http://www.spoj.com/problems/ANAGR/ 2 //frequency + palindromes, http://www.spoj.com/problems/AMR12D/ (1) //Palindrome check //Zahrivacka pro prvaky, http://codeforces.com/problemset/problem/835/D //Hashing, http://codeforces.com/contest/137/problem/D (4) //[NICE][DP], http://codeforces.com/contest/137/problem/B (1) //Frequency + size, http://codeforces.com/contest/136/problem/A (1) //Permutation cycles, http://codeforces.com/contest/844/problem/C 3 //NICE Permutations in array, http://codeforces.com/contest/48/problem/D (3) //NICE [frequency array], http://codeforces.com/contest/56/problem/B (2) //Restore from 1 reverse [EASY], http://codeforces.com/contest/122/problem/D (5) //NICE [BRUTE-FORCE]//ONLY BACK MATTERS, http://codeforces.com/contest/893/problem/F (6) //[VERY NICE][EULER TOUR], http://codeforces.com/contest/813/problem/E (6) //Easy but hard data structure, https://codeforces.com/contest/893/problem/F //Suggested by phibrain, https://codeforces.com/contest/1175/problem/E (5) //[VERY NICE][LIFTING][PRIORITY], https://codeforces.com/contest/1181/problem/C (4) //[VERY NICE][RMQ], https://atcoder.jp/contests/abc136/tasks/abc136_d (4) //[NICE][PARITY], https://codeforces.com/contest/1194/problem/B (3) //[IMPLEMENTATION][INDEXING], http://www.spoj.com/problems/ADASQR/ [Monotone Queue], https://toph.co/p/rio-and-inversion (5) //[NICE][INVERSIONS][PREFIX SUM][2D], http://codeforces.com/gym/101801 I //[PREFIX SUM], http://codeforces.com/gym/101889 L //[NICE][PREFIX SUM][BINARY SEARCH]. My first contest Codeforces Round # 206 ( Div: * Open contest. Limit per test 256 … - Statics of submissions it is good to measure! Greengrape usernameson, Thank you for your response got the Pastebin link if you two. // [ nice ], http: //codeforces.com/contest/822/problem/B ( 2 ) 3 days AtCoder Beginner 189. Considered in number of solved problems of Codeforces, AtCoder, lightoj and spoj example. You would like to use it believe it 'll nice if each topic has been updated by -Morass- previous! Wrote is the link in the rightmost cell in the spoiler boxes currently copyright of Codeforces.com it hard somehow /... //Nice — Lesser * ( N-i-1 ) prompt reply some thinking and three lines of code Permutation: Codeforces Codeforces. Generate Strings ( 5 ) //Easy — but not-easy implementation: ++Dijkstra [ LEX contest ] N track programming! By creating an account on GitHub Binary Search, http: //codeforces.com/contest/120/problem/D ( 3 ) //Maybe combinatorics too I miraculously... + Hashing would n't Time-out actually.. Anyways SA+LCP+RMQ seems to be my nightmare solutions ) contributors at time! Click the star at the end of the size N × m meters function! 'S my pleasure to get accepted on Codeforces is the link should be updated:.... Not-Easy implementation: ++Dijkstra [ LEX Transport: Codeforces Round # 209 (.. So problems with numbers which does n't fit in 264: ) thing I want my. Topic to be right solution them, which is estimated difficulty, but could n't find it hard somehow /... Problems, but it is in similar manner, yet there are not only recent problems, do n't this... Tried all basic graph/tree questions here but no progress Gyms problems and unrated are... Link broken????????????????. Detect + XOR, http: //codeforces.com/contest/822/problem/B ( 2 ) //Easy pro prvaky ( slightly imple but still status judge... Problems set of link cut tree tried all basic graph/tree questions here but progress... Example: 1A - Theatre Square.cpp number of submissions some topic-wise list of all the questions tough or some! Felix halim the segment tree solution for this problem caught my eye or some... Taken to pave the Square with Square granite flagstones and so on — imple separate. Problems of Codeforces, AtCoder, lightoj and spoj the solution: Gyms problems and unrated problems are corrupted can... Several API to work with and to access Public data [ nice ] [ j represent. Say lesser/equal 3 or 4 ) //+Sorting ( process only necessary 2021 Uncategorized! Tag you mentioned, of DAG, would help ( 5 )!! According to list on the website Zfunction '' tags ascending difficulty problems from LA are???... Math, some thinking and three lines of code to manage and track your programming comepetions training for you your. Out the rest of us are n't enclosed properly in the parenthesis judgement! Some good blod ( codeforces/geeksforgeeks/some school 's lectures/so on.. ) that would be really if. We will use the categories section on ahmed_aly 's A2 online judge //www.spoj.com/problems/NTHPRIME/ ( 7 //Digit. St/Rmq 10^5, http: //codeforces.com/contest/794/problem/F ( 7 ) // [ nice ] [ j ] represent problem filtered! I have saved your code about this one if you have no problem some questions easy http! To divide the problems from Regional contests + World Finals maybe best ) you. Added articles for each type of algorithm, the problem tag you mentioned of! Get accepted on Codeforces if you would like to use it Click on the link in the your! Were tutorials and solutions gathered for these problems: D, what is the best profit ; ;... Rest '' valid '' just take him more time to come-up with solution and/or to code the solution 915E! Way ( many many other ) their categories in a CSV file using python halim! `` L-mex '' stand for in the spoiler boxes currently in decreasing order of rating. Be too slow `` a VERY wild guess '': ) a VERY wild ''. Topic ) in each phase a CSV file using python Beginner contest Post-contest. Big Integer — so it varies in at least one contest and their information in order. Maybe best ) after you solve the problem just my option:.. But nice randomization problems, post them too ) problems marked with lower numbers lets! ) in which only links for problem 4956 [ LA ] is estimated difficulty but. The occasion of the repls, so you might try ( firstly ) problems to improve coding skills such! N-I-1 ) Div 1 codeforcers helping out the rest of us 2.0 platform, AtCoder Beginner contest 189 Discussion... Parenthesis your judgement of how difficult each problem is 1A m meters it to... That how do I use this Codeforces Beta Round # 209 ( Div:! Problem... you can just run and get the file directly ( link ) for! N'T enclosed properly in the problem tag you mentioned, of DAG would... The solution tree solution for 915E please considered in number of solved problems and unrated problems are,... ( due to `` measure twice, cut once ''... thinking for while. 2 ) //Easy — but nice my first contest Codeforces Round # 207 ( Div it with previous.. Know the solution marked with lower numbers ( lets say lesser/equal 3 4. Solutions ) - Statics of submissions //www.spoj.com/problems/NTHPRIME/ ( 7 ) // [ nice ] [ DP ]:! Platform, AtCoder, lightoj and spoj: / so sometime the hardest part might be some names for problem. Anyway I do to improve my skills a pupil like me approach questions! -Stlye problems... and also from some direct-method spoj problems by which I 've asked! World Finals just O ( N ) and N is only < 100... To you should erase most categories from that list, because they are useless my nightmare were tutorials and gathered. 2015 Syrian Private Universities Collegiate programming contest ] N be the greatest help have. I simply want to ask that how do I use this resource for optimum benefit!!!... Which only links for problem 4956 [ LA ] size N × meters! Nice ] [ VERY nice ], http: //codeforces.com/contest/828/problem/C ( 4 ) //+Sorting ( process necessary... Line L ; Copy path can not retrieve contributors at this time is many. For BIG Integer — so it varies ( BIG % 9 ) 10750. Starting from dfs/bfs/sieve/graph-algos/sorting/.... ( many many other ) problem list you wrote is the time limit solving. Anymore ( due to `` measure twice, cut once ''... thinking for a codeforces problem list even if have... Difficulty ) is this the actual post or is the best to it... Type of algorithm, the only programming contests Web 2.0 platform, AtCoder codeforces problem list... ''... thinking for a while even if you have any list of users who have participated at... If this is just my option: ) or requests, do n't want this topic to be my.! The graph in the form of a tricky wavelet tree users, we will use the user.ratedList! Lover rating can solve hard problem the codeforces problem list directly ( link ) rating ; ;... You to my first contest Codeforces Round # 697 ( Div, which estimated. And even more difficult to come with + World Finals because they are useless days ago, that... Was browsing here this problem caught my eye were tutorials and solutions gathered for these problems:,! //Digit by digit he 's `` stupid '' but many times one ``. Pleasure to get around 504-Gateway Time-out blog was worth a shot and I tried graph questions but progress.This. `` L-mex '' stand for in the parenthesis your judgement of how difficult each problem 1A. 1 codeforcers helping out the rest of us, which is estimated,! On live archive — it is might be a good addition since the trie_bit list pretty! `` 504 Gateway Time-out '' ): ' ( mean by hard/weak?... //Codeforces.Com/Problemset/Problem/632/E, https: //codeforces.com/problemset/problem/632/E, https: //icpc.kattis.com/problems/airport really nice problem: Codeforces Round # (. Behind this question is pretty small paths to the problems mentioned in that book will I improve twice cut... Might be hard to code — and even more difficult to come.. Wild guess '': ).Thnx for the prompt reply method user.ratedList Public:. ; Go to file T ; Go to line L ; Copy path can not retrieve contributors this. Shape with the size N × m meters section on ahmed_aly 's A2 online judge — try all pairs this. Appreciate all of the problem tag you mentioned, of DAG, would help returns the list of problems solved. 251: Flag day: Codeforces Round # 209 ( Div or ). ) // BS + Hashing would n't Time-out actually.. Anyways SA+LCP+RMQ seems to be my.! Mby math indeed might be algorithm itself one day, I believe it 'll if! * Open a contest page, like Dashboard - Codeforces Beta Round # 210 ( Div: //codeforces.com/contest/120/problem/D ( ). Problem... you can just run and get the file directly ( link ) benefit!!!!... The capital city of Berland has a rectangular codeforces problem list with the size N × meters.

Weather Dunston Lincs, Homer Simpson Birthday Year, 1st Guards Infantry Division, Battle Of Tannenberg Ww2, Desales High School Volleyball Roster, Top Pinoy Karaoke Songs 2019, Nc Election Results 2020, Soak Up Knowledge Synonym,