Problems from the IPSC Archive
Armed Bandit (Easy) You are in a casino, and you are anxious to play on the new one-armed bandit – a slot machine they j... 
Very Easy
85/95/162 |
Armed Bandit (Hard) You are in a casino, and you are anxious to play on the new one-armed bandit – a slot machine they j...
Easy
20/28/55 |
Brain Fold (Easy) Shandyna loves nerd sniping. (Don’t worry, she only does it in safe enviroments.) Last time she got ... |
Brain Fold (Hard) Shandyna loves nerd sniping. (Don’t worry, she only does it in safe enviroments.) Last time she got ...
Moderate
1/3/4 |
Attribution
These problems have been adapted from the problems made available in the IPSC archive under CC BY-SA 3.0 license. All changes made by Toph are available in this GitHub repository under the same license.
Tags
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
