# codeforces problem list

Programming competitions and contests, programming community . 13172 UVA (5) //6*DJ per query + permutations, 10816 UVA (4) //Easy Linear-Search by answer + DJ with path, http://codeforces.com/contest/827/problem/F 7 //Very nice — Even&Odd, http://www.spoj.com/problems/DELIVER/ (5) //Normalize coordinates + Optimalize, http://www.spoj.com/problems/CCHESS/ (4) //Dijkstra as knight, https://codeforces.com/contest/1175/problem/F (7) //[VERY NICE][HASH][RANDOMISATION], https://codeforces.com/contest/1181/problem/E2 (7) //[VERY NICE][SORTING][ST], https://codeforces.com/contest/1181/problem/E1 (5) //[VERY NICE][OBSERVATION][SORTING], https://codeforces.com/gym/102058/problem/G (7) //[VERY NICE][BS][PRIORITY_Q], http://codeforces.com/gym/101845/problem/L (6) //[VERY NICE][INDUCTION], http://codeforces.com/gym/101801 J //[NICE][TRIE][RMQ], 8257 — Factor-Free Tree LA //[VERY VERY NICE][PRIMES][FACTOR], https://www.urionlinejudge.com.br/judge/en/problems/view/1683 (4) //RAW histogram, http://codeforces.com/contest/817/problem/D (5) //Very nice NlogN, http://www.spoj.com/problems/DYNACON2/ (8) //Lesser hell — offline Nlog(N) /or/ NlogN^2, http://codeforces.com/contest/876/problem/F (5) //VERY NICE — Find greatest + next/back functions, https://codeforces.com/contest/1176/problem/D (4) //[NICE][GREEDY][SORTING], https://atcoder.jp/contests/abc136/tasks/abc136_e (5) //[NICE][GREEDY][DIVISORS], https://codeforces.com/contest/1183/problem/F (5) //[VERY NICE][SORTING][OBSERVATION][BF], https://www.spoj.com/problems/KPOWERSUM/ (4) //[FACTORISATION], http://codeforces.com/gym/101992/problem/D (5) //[VERY NICE][IE][NUMBER THEORY], http://codeforces.com/gym/101982 B //[FACTORISATION][GCD][SIEVE], http://codeforces.com/gym/101864 G //[VERY NICE][FACTORISATION][GCD], http://codeforces.com/gym/101840 D //[EVENTS][NICE], http://codeforces.com/gym/101741/problem/F (6) //[NICE][PROBABILITY][GCD], http://www.spoj.com/problems/FRNDAM/ (3) //Simply find sum of all divisors (low constraints), http://codeforces.com/contest/920/problem/F (5) //[NICE][FAST FALL][SET][DIVISORS], 7726 A Simple Math Problem (4) //TLE if naive (consider only divisors), http://codeforces.com/contest/112/problem/D (4) //[NICE] Last-position [FACTOR], http://codeforces.com/contest/75/problem/C (3) //[NICE][BS], https://www.hackerrank.com/contests/101hack38/challenges/easy-gcd-1/problem, https://www.codechef.com/problems/CHEFKEY, http://codeforces.com/problemset/problem/671/C, Gym 101411G [2009-2010 ACM-ICPC, NEERC, Western Subregional Contest], http://codeforces.com/problemset/problem/831/F, http://codeforces.com/problemset/problem/839/D, http://codeforces.com/problemset/problem/27/E, https://www.urionlinejudge.com.br/judge/en/problems/view/1164, http://codeforces.com/problemset/problem/803/F, http://www.spoj.com/problems/IITKWPCF/ //ll, http://codeforces.com/problemset/problem/703/E, https://www.hackerearth.com/problem/algorithm/harry-gets-into-infy/, http://www.spoj.com/problems/DIVSUM/en/ //SUM, https://codeforces.com/contest/1203/problem/F2 (6) //[VERY NICE][GREEDY][SORTING][CASES], https://codeforces.com/contest/1176/problem/F (5) //[NICE][IMPLE][SORTING], https://codeforces.com/contest/1200/problem/F (6) //[NICE][DFS][GRAPH][LCM][MATH], https://codeforces.com/contest/1201/problem/D (5) //[NICE][DP][IMPLE][CASES], https://www.spoj.com/problems/THECODE/ (4) //[BITMASK], https://codeforces.com/contest/1199/problem/F (5) //[NICE][DIMENSIONS], https://codeforces.com/contest/1183/problem/H (4) //[NICE][SUBSEQUENCE][NEXT], https://codeforces.com/contest/1183/problem/E (4) //[NICE][SUBSEQUENCE][NEXT], https://codeforces.com/contest/1178/problem/F2 (7) //[VERY NICE][OBSERVATION], https://codeforces.com/contest/1178/problem/F1 (5) //[NICE][MATH][REDUCTION], https://codeforces.com/contest/1178/problem/B (3) //[EASY]Not even real DP, https://codeforces.com/contest/1195/problem/C (3) //[EASY], https://codeforces.com/contest/1189/problem/F (6) //[VERY NICE][OBSERVATION], https://atcoder.jp/contests/agc035/tasks/agc035_d (5) //[VERY NICE][BIT][IDEA], https://www.spoj.com/problems/PLOVER/ (4) //[NICE][DIGITS], https://www.spoj.com/problems/NICESEQ/ (4) //[DIGITS][POSSIBLY FASTER], https://codeforces.com/gym/101981 L //[NICE], https://www.spoj.com/problems/RANDMOD/ (4) //[OBSERVATION][SEQUENCE], https://www.urionlinejudge.com.br/judge/en/problems/view/1592 (4) //[GRAPH], https://www.urionlinejudge.com.br/judge/en/problems/view/2824 (4) //Classical, https://codeforces.com/gym/102006/problem/D (4) //[NICE][OBSERVATION], https://codeforces.com/gym/102058/problem/D (5) //[NICE][DOMINATION], http://codeforces.com/gym/101992/problem/A (6) //[BITS][OBSERVATION], http://codeforces.com/gym/101628/problem/H (3) //[NICE][CLASSICAL][DAG], http://codeforces.com/gym/101628/problem/A (3), http://codeforces.com/gym/100112 J //[NICE][TREE], http://codeforces.com/gym/101982 D //[VERY NICE][BITS] //Window, http://codeforces.com/gym/101982 C //Classical combinatorics, http://codeforces.com/gym/101845/problem/E (5), https://www.codechef.com/problems/SPECTAC (5) //[NICE], http://codeforces.com/gym/101801 D //[VERY NICE][SEGMENT TREE][SORTING][NORMALIZE], http://codeforces.com/gym/101873 J //[NICE][IMPLEMENTATION][STRING][SUBSUBSET], http://codeforces.com/gym/101808/problem/D (7) //[NICE][OPTIMISATION][EFFICIENCY], http://codeforces.com/gym/101840 A //Doubles, DevSkills 475: Bunty's Xor Game (4) //[BITS][GAME THEORY], https://www.devskill.com/CodingProblems/ViewProblem/489 (5) //[NICE][FACTORISATION], DevSkills 534 (4) //[BITSET][COMBINATIONS], http://codeforces.com/gym/101650 D //Not hard — more coding + printing, 13286 — Ingredients (4) //[NICE][DAG] Classical, 8299 — Bricks (5) //[NICE][COMBINATORICS][SORTING], http://codeforces.com/contest/934/my (4) //Subsequence, http://codeforces.com/contest/922/problem/E (5) //find max mana, http://codeforces.com/contest/920/problem/D (4) //[NICE][KNAPSACK-MODULO][GREEDY], http://codeforces.com/contest/919/problem/D (4) //[NICE][DFS][CYCLE][DAG], http://codeforces.com/contest/914/problem/C (3) //[DIGITS][BINARY], http://codeforces.com/contest/913/problem/E (5) //[NICE][EXPRESSION], http://codeforces.com/contest/148/problem/E (5) //[DP][PREFIX SUM][GREED], http://www.spoj.com/problems/PALMKR/ (4) //Classical palindrome + print + lexicography, http://codeforces.com/contest/146/problem/E (5) //[NICE][COMBINATORICS][OBSERVATION], http://codeforces.com/contest/909/problem/C (4) //[NICE][CLASSICAL][EASY], 7785 — m-ary Partitions (4) //Combinatorics, http://codeforces.com/contest/133/problem/E (4) //[IMPLEMENTATION], http://codeforces.com/contest/126/problem/D (5) //[NICE]//Decomposet DP//Own hash-map, http://codeforces.com/contest/910/problem/B (3) //Or many other ways, 6154 RNA Secondary Structure (5) //[NICE] Unoptimal might work too, https://arc087.contest.atcoder.jp/tasks/arc087_b (4) //[VERY NICE][OBSERVATION], http://codeforces.com/contest/903/problem/F (5) //[VERY NICE][BITMASK][BRUTE], http://codeforces.com/contest/903/problem/A (2) //Easy knapsack-like // Low constraints, http://codeforces.com/contest/900/problem/E (4) //[NICE]//Patter-match: FFT or KMP or Brute-Force, http://codeforces.com/contest/118/problem/D (3) //[COMBINATORICS][LOW-CONSTRAINTS], http://codeforces.com/contest/115/problem/E (5) //[VERY NICE][SEGMENT TREE], http://codeforces.com/contest/116/problem/D (3) //CLASSICAL[LOW-CONSTRAINTS], 10128 Queue (uva) (4) //One possibility is bitmask — second combinatorics, http://codeforces.com/contest/110/problem/C (3) //[EASY]// Greedy/math works too, 8078 — Bracket Sequence (4) //[VERY NICE][DP-LINKS], http://codeforces.com/contest/106/problem/C (3) //[NICE][EASY], http://codeforces.com/contest/895/problem/C (4) //[NICE], 8024 Stack Construction (4) //[NICE] Palindromic style — but not exactly, http://codeforces.com/contest/888/problem/F (6) //[NICE][FLAG], http://www.spoj.com/problems/ACQUIRE/ (5) //[NICE][CH-OPT], http://codeforces.com/contest/319/problem/C (6) //[NICE][CH-OPT], http://www.spoj.com/problems/NKLEAVES/ (5) //[NICE][DC], http://codeforces.com/contest/76/problem/D (4) //[BITS][OVERFLOW], http://codeforces.com/contest/73/problem/C (4) //[NICE][EASY][TRY-ALL-LETTERS], http://codeforces.com/contest/67/problem/C (4) //[NICE][LEAVENSTEIN], http://codeforces.com/contest/67/problem/A (3) //[EASY][PRINTING][OTHER POSSIBLE WAYS], http://codeforces.com/contest/55/problem/D (5) //[NICE][DIGITS][EFFICIENT], http://codeforces.com/contest/56/problem/D (4) //String modification + printing [NICE], http://codeforces.com/contest/58/problem/E (6) //[NICE][IMPLEMENTATION], https://devskill.com/CodingProblems/ViewProblem/21, https://devskill.com/CodingProblems/ViewProblem/37, https://devskill.com/CodingProblems/ViewProblem/71, https://devskill.com/CodingProblems/ViewProblem/103, https://devskill.com/CodingProblems/ViewProblem/107, https://devskill.com/CodingProblems/ViewProblem/115, https://devskill.com/CodingProblems/ViewProblem/126, https://devskill.com/CodingProblems/ViewProblem/131, https://devskill.com/CodingProblems/ViewProblem/134, https://devskill.com/CodingProblems/ViewProblem/174, https://devskill.com/CodingProblems/ViewProblem/186, https://devskill.com/CodingProblems/ViewProblem/201, https://devskill.com/CodingProblems/ViewProblem/338, https://devskill.com/CodingProblems/ViewProblem/368, https://devskill.com/CodingProblems/ViewProblem/392, https://devskill.com/CodingProblems/ViewProblem/399, https://www.hackerrank.com/contests/world-codesprint-5/challenges/mining //Opti, http://codeforces.com/problemset/problem/631/E //CH, https://devskill.com/CodingProblems/ViewProblem/6, https://devskill.com/CodingProblems/ViewProblem/11, http://codeforces.com/contest/729/problem/F 6, http://codeforces.com/contest/735/problem/E 9, http://codeforces.com/contest/731/problem/E 5, http://codeforces.com/contest/721/problem/E 7, http://codeforces.com/contest/742/problem/D 4, http://codeforces.com/contest/712/problem/D 5, http://codeforces.com/contest/743/problem/E 6, http://codeforces.com/contest/745/problem/E (7), http://codeforces.com/contest/747/problem/F (5), http://codeforces.com/contest/752/problem/E (5), http://codeforces.com/contest/703/problem/E (7), http://codeforces.com/contest/722/problem/E (9), http://codeforces.com/contest/760/problem/F (8), 11451 UVA (4) //C==20 mistake in statement, http://codeforces.com/contest/762/problem/D 5, 11081 UVA (4) //3 string subsequences (beware of fail), http://codeforces.com/contest/678/problem/E (5) //bitset dp + probability, http://codeforces.com/contest/766/problem/C (4), http://codeforces.com/contest/667/problem/C (3), http://www.spoj.com/problems/MOVIFAN/ (3), http://www.spoj.com/problems/ORDSUM23/ (3), http://www.spoj.com/problems/DIVSEQ/ (4) //N^3 (but better...) works fine, http://codeforces.com/contest/633/problem/F (7) //Tree dp, http://www.spoj.com/problems/ADJDUCKS/ (4) sort + pick 2-3 continous O(N), http://www.spoj.com/problems/JLNT/ (4) //pick 0 or 2 | 1e3*5e3, http://www.spoj.com/problems/TPCPALIN/ (5) //500^3 works (3rd countable), http://www.spoj.com/problems/COLORSEG/ (4) //50^4==OK 50^4log(N)=TLE NICE, http://www.spoj.com/problems/POWERCAR/ (3) //1e3*1e3*2 — follow rules, http://www.spoj.com/problems/INGRED/ (5) //TSP-like [reduce + go], http://www.spoj.com/problems/BADXOR/ (4) //classical subsets, http://www.spoj.com/problems/SPCO/ (5) //64*64*2 DP {OPT: prime O(1) + clear only half}, http://www.spoj.com/problems/WAYHOME/ (5) //NICE: 1) 1*1 b)12,1,**,2, http://www.spoj.com/problems/NFURY/ (2) //Minimal sum of squares, http://www.spoj.com/problems/GDIL/ (3) //combinatorics, http://codeforces.com/contest/791/problem/D (5) //Tree, http://codeforces.com/contest/791/problem/E (6) //V,K,X — pick any, http://codeforces.com/contest/789/problem/C (3), http://codeforces.com/contest/796/problem/E (6) //NICE: N*P*K*K (WC can't happen! Sometimes there is much better solution then you came with, sometimes there is something awesome (like algorithmic/or/language trick) which might simplify your futher coding. is problem set arranged in order of ascending difficulty? 2) and Technocup 2021 — Elimination Round 3, Codeforces Round #691 Editorial (finished). I just listed these links for my personal Practice. On a separate note, I believe it'll nice if each topic has its list of tutorials too. Codeforces. It'll help me too. (26), http://codeforces.com/contest/767/problem/E (6), http://codeforces.com/contest/637/problem/B (3) //NICE pro prvaky, http://codeforces.com/contest/777/problem/B (3) // -||-, http://codeforces.com/contest/777/problem/D (3) //just go from end, http://codeforces.com/contest/779/problem/C (3) //NICE pro prváky, http://www.spoj.com/problems/SPCU/ (2) //Easy — zamysleni (max int = index), http://www.spoj.com/problems/LOPOV/ (4) //sort + queue (or just queue) NICE, http://codeforces.com/contest/792/problem/E (5) //T%S<=T/S + check proper, http://codeforces.com/contest/807/problem/E (5) //NICE — put asice P2 / rest — greedy from small, http://codeforces.com/contest/799/problem/E (5) //Many queues — but NICE, http://codeforces.com/contest/808/problem/C (3) //EASY, http://codeforces.com/contest/802/problem/B (4) //Priority by "next", http://codeforces.com/contest/813/problem/A (1) //Zahrivacka pro prvaky, 10716 UVA (4) //NICE — always find closest pair, http://codeforces.com/contest/816/problem/C (3) //NICE — greater

Copycat Shrimp Tacos, Blank Tier List, Spider-man Hand Video, Sweet Dreams Duvet Cover, Not Getting Credit For Heroic Hive Rituals, Ashok Dinda Ipl 2020, Where Was Columbus When He Wrote His Letter?, Poole To Jersey, Geometric Centroid Calculator, Crush's Dungeon Trophy, Channel 2 News Team, Casuarina, Nsw Rentals,