Abdullah Al Imran abdalimran

## C++ : nPr.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

long factorial(int n)
{

## C++ : nCr.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

long factorial(int n)
{

## PrimeGen Sieve Faster.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

bitset<10000010>bs;
vector<int>primes; //Stores tall the primes to n

## PrimeGen Sieve Normal.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

#define M 1000000

## Sieve divSum divCount.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include <bits/stdc++.h>

using namespace std;

#define MAX 500010

## Primality Testing.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

bool isPrime (int n)
{

## Base Conversion.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

void ConvertBase(int N,int base)
{

## Big Mod.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

//Big Mod
int big_mod(int base, int power, int mod)

## Mod Inverse 01.cpp
/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

//1. Brute Force
int modInverse(int a, int m)

## Mod Inverse 02.cpp

/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: abdalimran@gmail.com   */

#include<bits/stdc++.h>

using namespace std;

//2. Using Extended Euclidean Algorithm
	/* Bismillah hir rahmanir raheem. Thanks to Allah for everything.
	Coder: Abdullah Al Imran
	Email: abdalimran@gmail.com */

	#include<bits/stdc++.h>

	using namespace std;

	long factorial(int n)
	{