maskman_lucifer

lucifer.cpp

// Useful

// PBDS -- Sometimes gives quick AC in codeforces A,B
https://gist.github.com/maskmanlucifer/b0faa3f4a9672b3fe7a589437f1b5e6d

// Manchers -- One algo to solve 3,4 different type of problems efficiently
https://gist.github.com/maskmanlucifer/52bee9f747191a2bf736bcef8eea3cb8

// Prime factorization -- Different ways 
https://gist.github.com/maskmanlucifer/e8b54712040e90a8605122c415428106

// Checking if c is alphabet
if((c>='a' && c<='z') || (c>='A' && c<='Z'))

is Equivalent to 

if(isalpha(c)) 
  
// Checking if c is a digit 

if(c>='0' && c<='9')

is Equivalent to 

if(isdigit(c))
  
// Number of distinct prime divisors of any number is not too much (Have given me a lot of ACs)
  
// Not useful but funny
// You can put as many as ; you want to end any statement
  
#include <bits/stdc++.h>   
#define HUMBLEFOOL_IS_GOAT ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long 
#define pll pair<ll,ll>
#define pb push_back
#define M 1000000007
#define lc '\n'
using namespace std;
int main()
{
    HUMBLEFOOL_IS_GOAT
    int a;;;;;;;;;;;;;;;;
    cout<<a;;;;;;;;;;;;;;;;;
    return 0;
}


// You can put a website url in your program and it will work fine

#include <bits/stdc++.h>   
#define HUMBLEFOOL_IS_GOAT ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long 
#define pll pair<ll,ll>
#define pb push_back
#define M 1000000007
#define lc '\n'
using namespace std;
int main()
{
    HUMBLEFOOL_IS_GOAT
    string s="Weird";
    cout<<s<<lc;
    https://gist.github.com/maskmanlucifer/b0faa3f4a9672b3fe7a589437f1b5e6d
    return 0;
}