NumberTheory Problems
Powerful Number Efa loves numbers. She thinks a number is powerful if it can be expressed in the form xy where x and... |
Phi Numbers in Range! In number theory, Euler’s phi function, denoted as ϕ(n), is an arithmetic function which counts the ... |
Yet Another Hello World The greatest company, Pied Piper, is developing encryption systems. The company has already built Md... |
GCD and Sum Congratulations! You’ve been hired in “Buggy Software Ltd.” And you’ve been already given your first... |
The Game Is Back On Moriarty is bored again. When he gets bored, the only thing he wants to do is play with Sherlock. So... |
The Story of Two Friends There are two friends F1 and F2 in a city. They both are student of FCB High School. Also, they resi... |
Christmas Tree Professor Rio has an amazing Christmas tree. Unlike other trees, this Christmas tree has some specia... |
Is Bita Happy? Bita has learned bitwise-operations recently. She is doing some experiments with these operations no... |
Chowdhury Saheb & the Numbers You like short description of problems? Me too! Let's go to an easy problem. You are given an array ... |
Magic Number Count Magic number is an integer number, which is only divisible by itself and total number of divisor wil... |
Arko and Special Permutations Arko is very fond of permutations. He can easily calculate the number of n length permutations. (In ... |
Choice Is Yours For not participating on contests regularly, Hasnaine (read Has9) has decided to kill Santo. But nob... |
Co-Prime Enemy Pair Two integers A and B are known as co-prime or relatively prime if their greatest common divisor GCD ... |
Is It Perfect Bob has an initial array D of length n . Alice is a good friend of Bob. So Bob challenges Alice to f... |
Magician's Offer! Rosi Vidmun is a greedy landlord who likes to grab as much land as he can. Currently he has P square... |
Playing With Aladdin Aladdin is a fictional character and the titular protagonist of Walt Disney Pictures' 31st animated ... |
Easy Factorial? It is time to show your performance on number theory. Why so late? Come to the point. You are given... |
How Many Pairs of LCM? A Common Multiple of two integers a and b is an integer X, such that both a and b divides X. A numbe... |
Poltu and Trailing Zero Poltu gives a problem to his friend Boltu. The description is given below: You are given an integer ... |
Tom Is a Good Mentor Today is the first day of the little mouse Jerry at school. Famous mathematician Tom is his teacher.... |
GCD, Divisor, Count! I like short statements and you should too so here's the statement without further ado You are give... |
Kotlin Heroes The International Collegiate Programming Contest is an algorithmic programming contest for college s... |
A GRE Themed Contest Problem Sadman and Najkin were solving a GRE math problem, Rejbah another friend of theirs listened to that ... |
Quarantine!!! China is one of the strongest countries in the world in the sense of economy and military technology... |
M-Sequence A sequence is called M-sequence if after removing zero or more elements from the sequence the GCD of... |
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
