Problems from JnU Intra-Department Programming Contest 2018 (Junior Division)
A.
Pythagoras Rocks A Pythagorean triple consists of three positive integers a, b, and c, such that a2+b2=c2. The Pythag... |
B.
Arithmetic Sequence (Easy) Arithmetic Sequence is a sequence of numbers where the difference between two consecutive numbers ar... |
C.
Dominoes Forever Once when I was little, my father took me to a tobacco shop! It is surprising, but true. He asked th... |
D.
Word Count Counting the frequencies of words are a basic and important task in natural language processing. In ... |
E.
Smart Query Handler Bit operators perform bit-wise operations between two binary numbers. Wikipedia says, binary operati... |
F.
Arithmetic Sequence (Hard) Arithmetic Sequence is a sequence of numbers where the difference between two consecutive numbers ar... |
G.
Largest Prime A positive integer number n is called a prime number, if it is only divisible by 1 and n itself, whe... |
Practice Contest
Practice contests allow you to re-run contests and experience them as close as possible to the original run.
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
