Skip to main content

বিগেনার কম্পিটিটিভ প্রোগ্রামরদের জন্য কিছু প্রয়োজনীয় টপিকস

Competitive Programming For Beginners
Topics
Subtopics
1. Importance of calculating time/memory complexity and how to do it
1. Vector ( insert , erase , iteration )
2. Queue
3. Stack
4. Deque
1. Map (C++)
2. Priority Queue (C++)
3. Set (C++)
4. Linked list using array
1. Bitwise operation (AND , OR , XOR and more)
2. Manipulation of bits
3. Some special use
1.Calculating GCD efficiently (Euclidean algorithm)
2.Sieve (finding prime numbers)
3.Bitwise sieve
4. Factorization
5. Modular Arithmetic ( addition , multiplication , calculating bigmod)
6. Fermat's little theorem and its use
7. Totient function
8. Combinatorics (factorials , counting problem)
1. Bubble sort
2. Insertion sort
3. Counting sort
4. Selection sort
5. Quick sort
6. Merge sort
1. Introduction to recursion
2. Backtracking
1. Introduction to greedy algorithm and ad-hoc problems
1. What is graph theory?
2. How to store edges? (using vector and array)
3. How to traverse a graph? (DFS , BFS)
4. How to solve problem using graph theory
5. Connected Component (undirected graph)
6. Bicoloring problem
7. Shortest path problem (weighted and unweighted graph)
8. Longest path problem (tree)
1. What is dynamic programming?
2. State of dp and calculating time and memory complexity
3. Coin change
4. Knapsack
5. nCr
6. Longest Increasing subsequence ( n^2 )
7. Bitmask dp

Comments

Post a Comment

Popular posts from this blog

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...
Post a Comment
Read more

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 ...
Post a Comment
Read more

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...
Post a Comment
Read more