Chinese Remainder Theorem
Resources:
Chinese Remainder Theorem
Chinese Remainder Theorem ( E-Maxx)
GeeksForGeeks
forthright48 - Coprime Moduli part1
forthnight48- Non Coprime Moduli part 2
Codeforces article
Problems:
Chinese Remainder Theorem (non-relatively prime moduli)
Cheese and Random Toppings SOLUTION
1319 - Monkey Tradition SOLUTION
Number of Sequences
B. Remainders Game
Arkanoid (ark)
E. Billiard
Longest Common Subsequence ( LCS )
Number of single cycle components in an undirected graph (CF-977E)
E. Cyclic Components
resource
āĻšিāĻ¨্āĻঃ āĻĒ্āĻ°āĻ¤িāĻি āĻāĻŽ্āĻĒোāĻ¨েāĻ¨্āĻ āĻ āĻেāĻ āĻāĻ°āĻŦো āĻ¤াāĻĻেāĻ° āĻĒ্āĻ°āĻ¤্āĻ¯েāĻāĻি āĻ¨োāĻĄেāĻ° āĻĄিāĻ্āĻ°ি āĻĻুāĻ āĻিāĻ¨া, āĻ¯āĻĻি āĻĻুāĻ āĻšā§ āĻ¤াāĻāĻ˛ে āĻ¸েāĻা āĻāĻāĻা āĻ¸িāĻ্āĻেāĻ˛ āĻ¸াāĻāĻেāĻ˛ āĻāĻŽ্āĻĒোāĻ¨েāĻ¨্āĻ।
E-maxx training part - 03
Modular Multiplicative Inverse
UVa 11904 - One Unit Machine SOLUTION
Longest Increasing Subsequence Arrays SOLUTION
C. Beautiful Numbers
F. The Sum of the k-th Powers
A. Festival Organization
D. Nephren Runs a Cinema
Chinese Remainder Theorem
Number of Sequences
E. Billiard
Factorial modulo p in O(plogn)
Another Factorial Problem SOLUTION
FACTMODP - Factorial Modulo Prime
CF blog lik
geeksforgeeks
Discrete Root
F. Lunar New Year and a Recursive Sequence SOLUTION
Solving the DLP: Baby Step/Giant Step Algorithm
Discrete Logarithm
MOD - Power Modulo Inverted SOLUTION
GreyCode
Code
89. Gray Code ( leetCode)
Gray Code (Codechef)
249. Matrix (CF)
Submask Enumeration
E. Nuclear Fusion SOLUTION
E. Sandy and Nuts
1439 - Exclusive Access 2
11825 - Hackers' Crackdown
Arbitrary-Precision Arithmetic
10183 - How Many Fibs? SOLUTION
10106 - Product SOLUTION
787 - Maximum Sub-sequence Product SOLUTION
MUL - Fast Multiplication
GCD2 - GCD2
10083 - Division
495 - Fibonacci Freeze
10925 - Krakovia
10814 - Simplifying Fractions
623 - 500!
Project Euler #20: Factorial digit sum
12924 - Immortal Rabbits
IWGBS - 0110SS
D. Notepad
Fast Fourier transform
Bangla blog
Operations on polynomials and series
FACT0 - Integer Factorization (15 digits)
FACT0 - Integer Factorization (15 digits)
āĻāĻĒিāĻঃ āĻĒ্āĻ°াāĻāĻŽ āĻĢ্āĻ¯াāĻ্āĻāĻ°
āĻšিāĻ¨্āĻঃ āĻ¸িāĻ āĻĻিā§ে āĻāĻ°āĻ˛ে āĻাāĻāĻŽ āĻ˛িāĻŽিāĻ, āĻ¨āĻ°āĻŽাāĻ˛ি āĻāĻ°āĻ¤ে āĻšāĻŦে। āĻĒ্āĻ°āĻĨāĻŽে x = ā§¨ āĻĻিā§ে āĻ¯āĻ¤āĻŦাāĻ° āĻ¯াā§ āĻাāĻ āĻ¤াāĻ°āĻĒāĻ° ā§Š āĻĻিā§ে , āĻāĻ°āĻĒāĻ° ā§Ģ āĻĻিā§ে...
āĻ¯āĻāĻ¨ x*x >N āĻšā§ে āĻ¯াāĻŦে āĻ¤āĻāĻ¨ āĻ˛ুāĻĒāĻা āĻŦ্āĻ°েāĻ āĻšāĻŦে।
āĻāĻ°āĻĒāĻ° āĻļেāĻˇে āĻ¸ংāĻ্āĻ¯াāĻি ā§§ āĻāĻ° āĻেā§ে āĻŦā§ āĻĨাāĻāĻ˛ে āĻāĻāĻা āĻāĻāĻা āĻĒ্āĻ°াāĻāĻŽ āĻ¨াāĻŽ্āĻŦাāĻ° āĻšāĻŦে, āĻāĻ° āĻĒ্āĻ°āĻ¤িāĻŦাāĻ° āĻাāĻ āĻāĻ°াāĻ° āĻ¸āĻŽā§ āĻāĻāĻা āĻাāĻāĻ¨্āĻ āĻ°াāĻāĻŦো āĻ¯েāĻāĻা āĻĻ্āĻŦাāĻ°া āĻŦুāĻāĻŦো āĻāĻāĻা āĻāĻ āĻĒ্āĻ°াāĻāĻŽ āĻĄিāĻিāĻāĻ° āĻāĻ° āĻাāĻāĻ¨্āĻ।đ
āĻোāĻĄঃ
E-maxx training part - 02
Primality tests
Integer factorization
FACT0 - Integer Factorization (15 digits) Solution
FACT1 - Integer Factorization (20 digits)
FACT2 - Integer Factorization (29 digits)
GCPC 15 - Divisions
Euler's totient function
ETF - Euler Totient Function SOLUTION
UVA #10179 "Irreducible Basic Fractions
UVA #10299 "Relatives"
UVA #11327 "Enumerating Rational Numbers"
1673. Admission to Exam
UVA 10990 - Another New Function
Golu and Sweetness
LCMSUM - LCM Sum
GYM - Simple Calculations (F)
UVA 13132 - Laser Mirrors
GCDEX - GCD Extreme
UVA 12995 - Farey Sequence
TIP1 - Totient in permutation (easy)
1007 - Mathematically Hard
DCEPCA03 - Totient Extreme
NAJPWG - Playing with GCD
DCEPC12G - G Force
INVPHI - Smallest Inverse Euler Totient Function
D. Power Tower
Number of divisors / sum of divisors
COMDIV - Number of common divisors SOLUTION
DIVSUM - Divisor Summation SOLUTION
DIVSUM2 - Divisor Summation (Hard)