A.
One-dimensional Imagine there are several lines in an one dimensional space. You are given the starting and ending p... |

B.
Don't Shout It is well known on the Internet that you shouldn’t type in all caps. YOU SHOULDN’T. On the Internet...
Very Easy
283/325/632 |

C.
The Third Problem This is the third problem of today’s contest. In this problem you will be given a list of numbers. Y...
Moderate
409/426/715 |

D.
How Many X's? Given a string with only X’s you have to print how many X’s there are.
Very Easy
652/678/1k |

Practice contests allow you to re-run contests and experience them as close as possible to the original run.

2Sat, Adhoc, ApolloneasTheorem, Backtracking, BFS, Bignum, BinarySearch, BipartiteMatching, Bitmask, BruteForce, ChineseRemainderTheorem, Combinatorics, ConvexHull, CutVertex, DataStructure, DFS, DigitDP, DisjointSets, DivideAndConquer, DP, Eertree, EulerTour, ExpectedValue, FenwickTree, FFT, Flow, Game, GCD, Geometry, Graph, Greedy, Hashing, HeavyLightDecomposition, Implementation, InclusionExclusion, Interactive, KnuthMorrisPratt, LowestCommonAncestor, Math, Matrix, MatrixExponentiation, MergeSortTree, ModularExponentiation, MOSAlgorithm, MST, NTT, NumberTheory, Parsing, PersistentLiChaoTree, PersistentSegmentTree, PollardRho, PriorityQueue, Probability, Queue, RabinMiller, RangeOrderStatistics, Scheduling, SegmentTree, ShortestPath, Simulation, Sorting, SparseTable, SpragueGrundyTheorem, SqrtDecomposition, Stack, String, StronglyConnectedComponents, SuffixStructure, TernarySearch, Tree, Trie, TwoPointer, WaveletTree

Toph uses cookies. By continuing you agree to our Cookie Policy.