NumberTheory Problems
N-th Prime In this problem, you will have to print the n-th prime number. The first few prime numbers are given... |
Kotlin Heroes The International Collegiate Programming Contest is an algorithmic programming contest for college s... |
The Cipher In an ancient civilization, shrouded in the mists of time, there existed a group of mathematicians k... |
I Did Not Do the Assignment Professor Petr is very angry over some of his students now-a-days for not doing assignment. He wants... |
Correct the Sieve Sieve of Eratosthenes is a fast algorithm for finding prime numbers in larger ranges. According to W... |
Mystery of Fibonacci Fibonacci sequence is a recursive sequence that depends on the following definition: Fib(N) = Fib(N-... |
Laali Vs Bessie One day Raju discovered USACO and from that day he would spend all his time solving problems. Laali ... |
GCD Plus LCM In this problem you will be given two integers a, b. You have to answer if GCD(a,b)+LCM(a,b)=a+b is ... |
Modulo Let's get straight into the problem. In ths problem, here will be multiple test cases. In each test ... |
Challenging Lover Greetings to all of you. You must have heard about our star programmer Rafat bhai. One day he went o... |
Kitorp and His Love Kitorp loves his wife Asiar(who is a problem solver as well) but he loves math more. To get his atte... |
Equation Equals Hazards You are given the equation, GCD(A,M)=1. You have to determine whether there exists at least one inte... |
Largest Prime A positive integer number n is called a prime number, if it is only divisible by 1 and n itself, whe... |
Do you have Arithmophobia ? Don’t worry! If you are a programmer, you might not have arithmophobia!! But Era has a weird phobia ... |
Life of Phi II You will be given two integers n and m where GCD(n,m)=1. You have to tell that how many numbers are ... |
Left Prime Prime numbers are the ones which can only be divided by 1 and the number itself. 2, 3, 5, 7, 11, 13 ... |
Secret Meeting The world is terrified by Pandas! After a miraculous chemical explosion, they became smarter; and ev... |
Chowdhury Saheb & the Numbers You like short description of problems? Me too! Let's go to an easy problem. You are given an array ... |
Oh Functions Let’s define functions f and g as: f(x) = 2 * ( f(x-1) + g(x-1) - 1 ) * ( f(x-1) + g(x-1) - 3 ) + 12... |
Love Letters! Lately Fahim is getting a lot of love letters. A LOT of love letters. Since he is confused about whi... |
Zacob the Batsman It's known that Zacob is a reliable batsman of LU CSE Cricket Team. Also as long as he is on the cre... |
Sofdor Ali and the Puzzle of Weights Sofdor Ali is one of the most famous scientists of Bangladesh. He is also well known for his puzzle ... |
Fast Co-Prime Two numbers A and B are called co-prime if the only common positive factor of the two numbers is 1. ... |
Meena O Dosto Sele Dosto sele Dipu and his friends used to disturb Rita Apu everyday on her way to school singing , " র... |
Trick or Trees One day, Raju was out roaming in the woods,when he suddenly stumbled upon a large garden. There were... |
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
