README.md

Competitive-Programming

Table of contents

1. Dynamic Programming

   • Basic Problems
     • Minimum Steps One
   • 0/1 Knapsack
     • Coin Change
   • Fibonacchi
     • Top Down
     • Bottom Up
   • LCS
   • LIC
   • Shortest path
   • nCr

2. Mathematics

   • Addition
   • Basic Math
     • Number of digit in a number
   • Division
   • Factorial
     • Factorial
     • Number of digit in n!
     • Factorize of Factorial
   • Multiplication
   • Permutation
     • permutation Algorithm
   • Subset
   • Subtraction

3. Number Theory

   • Euclidean
     • Extended Euclidean
   • GCD
     • Euclidean
   • Mod
     • Big Number's Mod
   • Prime Factorization
     • Prime Factorization
   • Prime Numbers
     • Check Prime (Fermet's law)
     • Normal Sieve
     • Bitwise Sieve
     • Segment Sieve

4. Recusrsive

   • Random Problem 1
   • Random Problem 2

5. Graph

   • BFS
   • DFS
   • Topological Sort
   • Trie

6. String

Basic Tamplate

We can hide anything, even code!

#include<bits/stdc++.h>
#define F_READ   freopen("input.txt", "r", stdin);
#define F_WRITE   freopen("output.txt", "w", stdout);
#define IOS   ios_base::sync_with_stdio(false); cin.tie(NULL)
#define PB   push_back
#define F   first
#define S   second
#define REP(i,a,b)   for(int i=a; i<=b; i++)
#define I_REP(i,a,b)   for(int i=a; i>=b; i--)
#define ISEVEN(a) (a&1?0:1)
#define BIT_NO_OF_1(a) (__builtin_popcount(a))
#define BIT_NO_OF_LEADING_0(a) (__builtin_clz(a))
#define BIT_NO_OF_TRAILING_0(a) (__builtin_ctz(a))
#define STRING_TO_INT(v,s) for(int i=0; i<s.size(); i++) v.PB(s[i]-'0');
#define INT_TO_STRING(a,x) for(int i=0; i<x.size(); i++) a+=x[i]+'0';

using namespace std; 

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef pair<int,string> pis;
typedef pair<string,string> pss;
typedef pair<string,int> psi;
typedef map<int,int> mii;

int main() {
  IOS;
  cout<<"Hello World";
  return 0;
}