FlandreScarle7/Codeforces-SolutionsA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update temp

Browse Source
This commit is contained in:
ShazidMahsrafi 2023-12-24 19:20:31 +06:00
parent 3da55f7e06
commit d5cd9e692c
1 changed files with 12 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
Template/CPTemp.cpp
View File

@ -4,6 +4,7 @@ using namespace std;
// Short forms // Short forms
#define int long long #define int long long
#define ll long long #define ll long long
#define ull unsigned long long
#define endl '\n' #define endl '\n'
#define ff first #define ff first
#define ss second #define ss second
@ -17,20 +18,23 @@ using namespace std;
// Constants // Constants
#define PI 3.141592653589793238 #define PI 3.141592653589793238
#define MIN INT_MIN
#define MAX INT_MAX
#define INF LONG_LONG_MAX #define INF LONG_LONG_MAX
#define MOD 1e9+7 #define M 1000000007
#define LLM 1000000000000000007
// Faster Input Output // Faster Input Output
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL)); #define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
// Maths // Maths
ll fact(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; } ll fact(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
ll nPr(ll n, ll r) { return fact(n) / fact(n - r); } ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); } ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); } ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);} ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
ll mypow(ll a, ll b) { ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; } ull mypow(ull a, ull b) { ull ans = 1; a%=M; while(b){ if (b&1) ans = (ans*a) % M; a = (a*a) % M; b >>= 1; } return ans; }
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; } bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
//Debugging //Debugging
#ifndef ONLINE_JUDGE #ifndef ONLINE_JUDGE