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

 

 

 

 

 

 

 

Share:

Read More

FACT0 - Integer Factorization (15 digits)

FACT0 - Integer Factorization (15 digits)

টপিকঃ প্রাইম ফ্যাক্টর

হিন্টঃ সিভ দিয়ে করলে টাইম লিমিট, নরমালি করতে হবে। প্রথমে x = ২ দিয়ে যতবার যায় ভাগ তারপর ৩ দিয়ে , এরপর ৫  দিয়ে...

যখন x*x >N হয়ে যাবে তখন লুপটা ব্রেক হবে।

 এরপর শেষে সংখ্যাটি ১ এর চেয়ে বড় থাকলে ওইটা একটা  প্রাইম নাম্বার হবে, আর প্রতিবার ভাগ করার সময় একটা কাউন্ট রাখবো যেইটা দ্বারা বুঝবো ওইটা ওই প্রাইম ডিভিজর এর কাউন্ট।😀

কোডঃ

 

Share:

Read More

প্রাইম জেনারেশন সিভ ও প্রাইম ফ্যাক্টরাইজেশন

Resources:

প্রাইম জেনারেশন সিভ ও প্রাইম ফ্যাক্টরাইজেশন 

Integer factorization 

Share:

Read More

1112 - Curious Robin Hood

1112 - Curious Robin Hood

Topic: BIT

Share:

Read More

E-maxx training part - 02

Primality tests

1. PON - Prime or Not   Solution

Integer factorization 

1. FACT0 - Integer Factorization (15 digits) Solution

2. FACT1 - Integer Factorization (20 digits) 

3.  FACT2 - Integer Factorization (29 digits)

4. GCPC 15 - Divisions 

Euler's totient function

1. ETF - Euler Totient Function    SOLUTION

2. UVA #10179 "Irreducible Basic Fractions 

3. UVA #10299 "Relatives" 

4. UVA #11327 "Enumerating Rational Numbers" 

5. 1673. Admission to Exam 

6. UVA 10990 - Another New Function 

7. Golu and Sweetness 

8. LCMSUM - LCM Sum

9. GYM - Simple Calculations (F) 

10. UVA 13132 - Laser Mirrors 

11. GCDEX - GCD Extreme 

12. UVA 12995 - Farey Sequence 

13. TIP1 - Totient in permutation (easy) 

14. 1007 - Mathematically Hard  

15. DCEPCA03 - Totient Extreme

16.   NAJPWG - Playing with GCD

17. DCEPC12G - G Force 

18. INVPHI - Smallest Inverse Euler Totient Function 

19. D. Power Tower 

    Number of divisors / sum of divisors

    COMDIV - Number of common divisors   SOLUTION

     DIVSUM - Divisor Summation    SOLUTION

    DIVSUM2 - Divisor Summation (Hard) 

 

Share:

Read More

Mixing Milk

Mixing Milk

Topic: Greedy

Share:

Read More

PON - Prime or Not (Miller Robin)

PON - Prime or Not

Topic: Miller Robin 

Resource:  

Primality Test | Set 3 (Miller–Rabin) 

Miller Robin 

 

Share:

Read More

Primes Counts 1 to n

Block sieving

Share:

Read More

Nth Fibonacci Number

Resource

Fibonacci no in O(log N) time 

Solving the Fibonacci Sequence with Matrix Exponentiation 

An amazing way to calculate 10^18-th fibonacci number using 25 lines of code. 

 

Share:

Read More

Is Fibo

Is Fibo

Topic: Fibonacci

Share:

Read More

CEQU - Crucial Equation

CEQU - Crucial Equation

 Topic: Linear Diophantine Equation

 

Share:

Read More

10104 - Euclid Problem

10104 - Euclid Problem

                      Resources

Extended Euclidean Algorithm 

এক্সটেন্ডেড ইউক্লিডীয়ান অ্যালগোরিদম

Extended Eu

 Modular Arithmetic for Beginners

 

 

 

Share:

Read More

GCD and LCM

GCD and LCM

Share:

Read More

E-maxx training part - 01

                         Binary Exponentiation

• 1230 - MODEX              Solution

• 11029 - Leading and Trailing     Solution

• I. Parking Lot

• LASTDIG - The last digit

•  LOCKER - Magic of the locker

• LA - 3722 Jewel-eating Monsters

•  ZSUM - Just Add It

Euclidean algorithm for computing the greatest common divisor

• GCD and LCM   Solution

              Extended Euclidean Algorithm

•  10104 - Euclid Problem    Solution

• GYM - (J) Once Upon A Time

• UVA - 12775 - Gift Dilemma 

Linear Diophantine Equation

•  CEQU - Crucial Equation  Solution

• 106. The equation 

• A. Ebony and Ivory

• Get AC in one go

• 1306 - Solutions to an Equation

Fibonacci Numbers 

• MAIN74 - Euclids algorithm revisited  Solution

• FIBOSUM - Fibonacci Sum 

• Is Fibo    Solution

• Project Euler #2: Even Fibonacci numbers

                   

  Sieve of Eratosthenes

  TDPRIMES - Printing some primes   --> Solution

  HS08PAUL - A conjecture of Paul Erdős

  VECTAR8 - Primal Fear

  PTRI - primes triangle (I)

  A. Almost Prime

  B. Sherlock and his girlfriend

  NGIRL - Namit In Trouble

  DCEPC505 - Bazinga!

  Project Euler #134: Prime pair connection

  NFACTOR - N-Factorful

  BSPRIME - Binary Sequence of Prime Number

  UVA 11353 - A Different Kind of Sorting

  PRIMES2 - Printing some primes (Hard)

  A. Noldbach problem

  B. Colliders

 

Share:

Read More

Find n-th lexicographically permutation of a string

Find n-th lexicographically permutation of a string

Complexity: O(string length)

 

Share:

Read More

11029 - Leading and Trailing

11029 - Leading and Trailing

 Topic: Binary Exponentiation

 

Share:

Read More

1230 - MODEX

1230 - MODEX

Modular Arithmetic for Beginners 

Topic: Binary Exponentiation

 

Share:

Read More

Dual Palindromes

Dual Palindromes

Share:

Read More

Palindromic Squares

Palindromic Squares

 একটা সংখ্যার বেস দেওয়া থাকবে, ঐ বেসে  ১ থেকে ৩০০ এর মঝে যত প্যালিন্ড্রমিক   (সংখ্যাটির বর্গের)   নাম্বার আছে সেগুলা প্রিন্ট করতে হবে।

Share:

Read More

INVCNT - Inversion Count

                                                 INVCNT - Inversion Count

Topic: BIT

Share:

Read More