Created
June 15, 2020 05:21
-
-
Save amanharitsh123/137fc8edc5e0c4b599c5956d0d998558 to your computer and use it in GitHub Desktop.
Competitive Programming template
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<bits/stdc++.h> | |
using namespace std; | |
typedef long long int lli; | |
#define all(arr) arr.begin(),arr.end() | |
#define f first | |
#define s second | |
#define debug1(x) cout<<x<<"\n" | |
#define debug2(x,y) cout<<x<<" "<<y<<"\n" | |
#define debug3(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n" | |
#define nl cout<<"\n"; | |
#define pq priority_queue | |
#define inf 0x3f3f3f3f | |
#define test cout<<"abcd\n"; | |
#define pi pair<int,int> | |
#define pii pair<int,pi> | |
#define pb push_back | |
#define MOD 1000000007 | |
template <typename T> | |
void input(vector<T> &arr,lli n) { | |
T temp; | |
for(lli i=0;i<n;i++) cin>>temp, arr.push_back(temp); | |
} | |
template <typename T> | |
void output(vector<T> arr) { | |
for(auto x:arr) cout<<x<<" "; | |
cout<<endl; | |
} | |
template <typename T> | |
void input_set(set<T> &arr,lli n) { | |
T temp; | |
for(lli i=0;i<n;i++) cin>>temp, arr.insert(temp); | |
} | |
lli mul(lli a, lli b) { | |
return (a%MOD*b%MOD)%MOD; | |
} | |
lli power(lli num,lli base) { | |
lli ans = 1; | |
while(base>0) { | |
if(base&1) | |
ans = mul(ans, num); | |
num = mul(num, num); | |
base >>= 1; | |
} | |
return ans; | |
} | |
void solve() { | |
} | |
int main() { | |
ios_base::sync_with_stdio(false); | |
cin.tie(NULL); | |
lli testcases; | |
cin>>testcases; | |
while(testcases--) { | |
solve(); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment