Some Problems on Number Theory

1. Divisibility/Primes/Co-prime/GCD/LCM
Problems:
1. LOJ: 1014, 1035
2. CF: 230B, 711E, 585E, 585C, 222C, 546D, GYM101212B , 72A
3. SPOJ: LCMSUMH
4. E-OLYMP: 1146, 1243, 1147, 1229, 1244, 1230

2. Continued Fraction
Problems:
1. UVA: 834
2. HackerRank: euler064

3. Diophantine Equations
Problems:
1. LOJ: 1077
2. CF: 7C

4. Functions: Counting Divisors/Divisor Sum
Problems:
1. LOJ: 1054
2. UVA: 13083

5. Function: Totient and Similar
Problems:
1. LOJ: 1007
2. SPOJ: NFACTOR , NDIV

6. Modular Arithmetic/CRT
Problems:
1. LOJ: 1067
2. CF: 687B, GYM100825A

7. Discrete Logarithms
Problems:
1. LOJ: 1325

8. Number Systems
Problems:
1. LOJ: 1028
2. E-OLYMP: 1001, 1002, 1008, 1013

9. Primitive Root
Problems:
1. E-OLYMP: 647

Comments

Game Theory with examples

Game Theory with examples Introduction In this article I will be covering problems related to two players game in which it is assumed that both players play optimally and we have to find out the winner of the game. First we will look at the basic division of positions to winning and losing . Then we will see the Game of Nim and then see how it will be used to solve the Composite games . Basic Division of positions to winning and losing Problem Statement: Consider a simple game played by two players A and B . There are n stones on the table. Each player can pick 1 , 2 or 5 stones in each turn. Both players pick the stones alternately until the total number of stones left on the table is 0. The player unable to make the move will lose. Assuming that both the players play optimally, output the winner of the game. Solution: As you can see positions 1 , 2 and 5 are winning positions since the player can pick up all the stones and other player will n...

Breaking The Summation Formula (Part 1)

Q. f ( n ) = - 1 + 2 - 3 + .. + ( - 1) n n . Given n, find out f(n) Approach(1)- Bruteforce: 1. Calculation sum=n*(n+1)/2 2. loop[i=1,i=n : i+=2] odd+=i 3.ans=sum-2*odd Code: #include < bits / stdc ++. h > using namespace std ; int main (){ long long x ; cin >> x ; long long p =( x *( x + 1 ))/ 2 ; long long bad = 0 ; for ( long long i = 1 ; i <= x ; i += 2 ) bad += i ; cout << p - 2 * bad << endl ; } Approach(2)-Greedy: Basic: s=1+2+3+4+....+n Formula: sum=n*(n+1)/2= (n/2) + (n+1).2 ...

NT Part 2: Generating Primes, Prime Test, Prime Factorization

Generating primes fast is very important in some problems. Let's cut to the chase and introduce Eratosthenes's Sieve. The main idea is the following. Suppose we want to find all primes between 2 and 50. Iterate from 2 to 50. We start with 2. Since it is not checked, it is a prime number. Now check all numbers that are multiple of except 2. Now we move on, to number 3. It's not checked, so it is a prime number. Now check all numbers that are multiple of , except 3. Now move on to 4. We see that this is checked - this is a multiple of 2! So 4 is not a prime. We continue doing this. Here's the implementation. #include <stdio.h> int primechk [ 21000 ] ; void preprocess ( void ) { int i, j ; for ( i = 2 ; i <= 20000 ; i ++ ) { primechk [ i ] = 1 ; } for ( i = 2 ; i <= 20000 ; i ++ ) { if ( primechk [ i ] == 1 ) { for ( j = 2 ; i * j <= 20000...

This lifeless coder is welcoming you!

Search This Blog