I.e. It seems UVa live archive have some problem on the website. All you need today is math, some thinking and three lines of code. NICE! 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. List of problems solved by particular user., While it is definitely possible to do that in CodeForces it will be very tedious and not efficient as it would require parsing users for each problem! http://codeforces.com/contest/37/problem/C (4) //NICE — Prefix dictionary [or math], http://codeforces.com/gym/101628/problem/K (5) //[NICE][IMPLEMENTATION], 8015 — Alice and Bob play Contact (5) //[VERY NICE] 1stBob, http://www.spoj.com/problems/TRYCOMP/ (4), 10860 UVA (4) //DP + Trie [nice — slightly generic], http://www.spoj.com/problems/DICT/ (4) //Sample trie — but slightly weak/wrong data-set, https://www.urionlinejudge.com.br/judge/en/problems/view/2810 (5) //[NICE][DOUBLE], Gym 100818E [2015-2016 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2015)]. - Skip inactive phases. Codeforces. Codeforces Round #193 (Div. http://www.spoj.com/problems/LOOPEXP/ (4) //A000254/N! ), 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. It seems that you don't like Möbius inversion much. Is cf div. 7988 Flow Shop (3) //Do as they say. Actually I am looking for a good problemset on codeforces.If any user while solving problems keep their information please mention your list of problems according to topics.Basically advance data structure problems would be a big plus..Thanks in advance. Atcoder Beginner Contest 189 Post-contest Discussion. What Tag I should add if I want problems related to segments (like finding union, intersections...etc) or swipe line technique? Codeforces Visualizer allows you to view list of upcoming contests schedule and past contests. Fenwick : https://www.spoj.com/problems/NARHIL/, Bridge Problem : http://codeforces.com/contest/1000/problem/E, the question ada and power mentioned in friedvald algorithm section is giving wa for test file 15. please give some insights. A - Helpful Maths Problem Link : [Codeforces 339A##link##] [tab] C++ #include #include using namespace... Codeforces 110 - A problem solution A. Hmm okkey not sure whether BS + Hashing wouldn't time-out actually.. Anyways SA+LCP+RMQ seems to be right solution. Note: Gyms problems and unrated problems are only considered in number of solved problems and number of submissions. Afterward it is imho good to do many easy (at most medium) problems to improve coding skills. I've been asked to make some topic-wise list of problems I've solved. Programming competitions and contests, programming community. Paths to the problems are corrupted, can you fix them? No No, infact I WANTED an answer to my silly question but you gave me the answer I NEEDED to progress further, thank you so much!! Codeforces presents several API to work with and to access public data. Thank you . I thought this list might come to use (to all — not just to comfi :P ) … are all the questions tough or are some questions easy, how does a pupil like me approach those questions??? Find first + Binary Search, http://codeforces.com/contest/872/problem/D (4) //NICE! Thanks a lot! As I was browsing here this problem caught my eye. Codeforces. 840D - Destiny is a nice example of a tricky wavelet tree. Good day to you sahil070197 GreenGrape usernameson, Thank you for your contriution. ), Unfortunatelly it is not much possible imho :'(. 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"). So you might try (firstly) problems marked with lower numbers (lets say lesser/equal 3 or 4). Has anybody counted ? http://www.spoj.com/problems/PHT/ (2) //easy BS (NN+2N) mby math? xD, It is might be used slightly in "different" manner then normal math problems. I wrote a script to save all these questions along with their categories in a CSV file using python. Codeforces. 7703 — Reading Digits (2) //Simple simulate what they ask for, http://codeforces.com/contest/893/problem/A (1) //Easy but nice, http://codeforces.com/contest/102/problem/B (2) //Do as they write — log-convergence, http://codeforces.com/contest/92/problem/A (1) //Way too easy, http://codeforces.com/contest/88/problem/C (3) //[NUMBER THEORY], http://codeforces.com/contest/84/problem/D (4) //Priority queue by min*size, http://codeforces.com/contest/79/problem/A (1) //Simulate rules, http://codeforces.com/contest/879/problem/A (1) //Iterate day-by-day, http://codeforces.com/contest/879/problem/B (3) //Either at most N^2 or the biggest element [NICE], http://codeforces.com/contest/879/problem/D (4) //[NICE][Array elimination], http://codeforces.com/contest/46/problem/A (2) //[EASY][MODULO], http://codeforces.com/contest/46/problem/B (3) //[EASY][SEARCH-EACH-QUERY], http://codeforces.com/contest/55/problem/A (2) //Simple (long) simulation, http://codeforces.com/contest/60/problem/A (1) //Moving LR bounds, http://codeforces.com/contest/724/problem/C 5, http://codeforces.com/contest/746/problem/C 3, http://codeforces.com/contest/768/problem/C (4), http://www.spoj.com/problems/WRONG/ (5) //VERY NICE — precalculate from back, then go from front, http://codeforces.com/contest/864/problem/C (4) //Not nice — just iffs, http://www.spoj.com/problems/WAGE/ (3) //Simple Game Of Life Modification, http://codeforces.com/contest/6/problem/C (2) //Simple simulate from both sides, http://codeforces.com/contest/9/problem/B (2) //Simulate what is given (+ doubles), http://codeforces.com/contest/11/problem/B (3) //sqrt(X) [diff must be even], http://codeforces.com/contest/30/problem/A (2) //Simply simulate process [-1000→ 1000], https://codeforces.com/contest/1174/problem/B (3) //[OBSERVATION] Nice yet simple, https://codeforces.com/contest/1174/problem/A (2) //[EASY], https://codeforces.com/contest/1203/problem/E (4) //[GREEDY][SIMPLE], https://codeforces.com/contest/1203/problem/B (3) //[GREEDY][NICE], https://codeforces.com/contest/1185/problem/D (4) //[BF][IMPLE][MATH], https://codeforces.com/contest/1185/problem/C1 (3) //[GREEDY], https://codeforces.com/contest/1197/problem/C (4) //[NICE][EASY][OBSERVATION], https://codeforces.com/contest/1197/problem/A (3) //[SIMPLE][GREEDY][MATH], https://codeforces.com/contest/1189/problem/B (3) //[EASY][OBSERVATION], https://www.spoj.com/problems/SWAPDIFF1/ (4) //[CLASSICAL][INVERSIONS], https://www.spoj.com/problems/SHINCARD/ (4) //[NICE], https://www.spoj.com/problems/POTATOPL/ (4) //[NICE][GREEDY], https://codeforces.com/gym/101991/problem/I (3), http://codeforces.com/gym/101962/problem/M (4), http://codeforces.com/gym/101726/problem/E (3) //[STRUCTURES][IMPLEMENTATION], 8260 Installing Apps (4) //[NICE] //Sorting + some DP, http://codeforces.com/contest/922/problem/D (3) //[NICE][GREEDY][EASY], http://codeforces.com/contest/920/problem/C (3) //[EASY] Sortable by parts, http://codeforces.com/contest/913/problem/D (4) //[NICE][BS][2P][FW], http://codeforces.com/contest/149/problem/A (2) //Sorting|Greedy, http://www.spoj.com/problems/SEUG/ (2) //Bad statement, http://codeforces.com/contest/141/problem/A (2) //Or frequency, http://codeforces.com/contest/137/problem/E (4) //[NICE][PREFIX SUM MATCHING], http://codeforces.com/contest/137/problem/C (4) //[NICE][FENWICK WORKS TOO], http://codeforces.com/contest/136/problem/C (3) //Last to 1(2) |OR| first to INF, 7673 — What a Simple Research (2) //[EASY][IMPLE], http://codeforces.com/contest/108/problem/B (2) //Easy & Adjacent, http://codeforces.com/contest/892/problem/A (2) //[EASY][SUM], https://www.urionlinejudge.com.br/judge/en/problems/view/2290 (3) //Sort+check [fast], http://codeforces.com/contest/81/problem/C (3) //MATH[Lesser=greater][comparator], http://codeforces.com/contest/53/problem/D (3) //Bubble sort, http://codeforces.com/contest/58/problem/D (4) //[BUCKET][GREEDY][STRING], http://codeforces.com/problemset/problem/645/B //INV, http://www.spoj.com/problems/BUBBLESORT/ //INV, http://www.spoj.com/problems/CODESPTB/ //INV, http://codeforces.com/problemset/problem/749/E //INV, http://codeforces.com/contest/731/problem/D 7, http://codeforces.com/contest/747/problem/D (4). — 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]. Theatre Square. ], http://codeforces.com/contest/122/problem/C (3) //Just around 2^10 lucky [RECURSION], 7899 — Mr. Panda and Strips (4) //Weak test-cases, 7671 What a Beautiful Lake (2) //Try up/down from every node, http://codeforces.com/contest/110/problem/A (1) //4 or 7, http://codeforces.com/contest/106/problem/B (2) //Cycles -_-, http://codeforces.com/contest/895/problem/A (2) //All segments [in circle], http://codeforces.com/contest/893/problem/B (2) //Try each divisor, http://codeforces.com/contest/894/problem/A (1) //3-cycles, http://codeforces.com/contest/892/problem/C (3) //Try to find "1" ASAP, http://codeforces.com/contest/102/problem/A (2) //Iterate over all triples, http://codeforces.com/contest/96/problem/B (2) //Check all, http://codeforces.com/contest/94/problem/B (1) //3cycles, http://codeforces.com/contest/887/problem/B (3) //Test all numbers, http://codeforces.com/gym/101597/problem/A (4) //[MATH][MODULO][SIMULATION], http://codeforces.com/contest/68/problem/C (5) //[VERY NICE][RECURSION][MAX COST MIN FLOW], http://codeforces.com/contest/68/problem/A (1) //Simple simulation, http://codeforces.com/contest/66/problem/B (2) //Test always whole platform, http://codeforces.com/contest/46/problem/C (2) //[2pointers][N^2 works too], http://codeforces.com/contest/47/problem/D (4) //[Implementation][DFS], http://codeforces.com/contest/51/problem/D (4) //Check all/check without 1s/2nd, http://code-festival-2017-qualc.contest.atcoder.jp/tasks/code_festival_2017_qualc_b (2), http://codeforces.com/contest/53/problem/B (3) //at most 60 possibilities, http://codeforces.com/contest/55/problem/B (3) //Try all permutations & possibilities [NICE], http://codeforces.com/contest/877/problem/B (3) //NICE [N^2][PrefixSum], LA 6623 — Battle for Silver (3) //4 for-cycles inside ~ K4 search, http://codeforces.com/contest/725/problem/C 4, http://codeforces.com/contest/725/problem/E 6, http://codeforces.com/contest/724/problem/B 3, http://codeforces.com/contest/753/problem/C 7, http://codeforces.com/contest/698/problem/D 8 //with geometry, http://codeforces.com/gym/101840 F //[NICE][BS][DISTANCE], 11206 UVA (6) //4^20 (but somehow passes), 11127 UVA (4) //Simple dfs [just realize you can do so], http://www.spoj.com/problems/BOKAM143SOU/ (3) //just implement for-cycles, http://www.spoj.com/problems/BLOPER/ (4) dfs with little pruning, 13173 UVA (3) //just brute-force + branching, http://codeforces.com/contest/799/problem/D (4) //VERY NICE [only top 34 needed] — trick with 2 [~20], 10890 UVA (4) //Simple brute-force times out, but with simple pruning AC (answer detection, http://codeforces.com/contest/813/problem/B (3) //All*All (BF) care for overflow!

Spruha Joshi Husband, Rowenta Steam Iron, Lodge For Rent, Sesame Place Christmas Reviews, Ira Withdrawal And Redeposit, Map Of War In Genesis 14, Craigslist Oregon Rooms For Rent, Little Big Book Aa, Higher Education In Japan, Dutch Bakery Items,