Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Temp
#include<bits/stdc++.h> using namespace std; #define ll long long #define M 1000000007 #define ff first #define ss second #define mp make_pair #define pb push_back #define io ios_base::sync_with_stdio(false);cin.tie(NULL); #define loop(i,a,n) for(int i=a;i<n;i++) #define trav(a,x) for(auto &a:x) #define vi vector<int> #define vl vector<ll> #define pii pair<ll,ll> #define w 1e5 void solve() { } int main() { // your code goes here io; int t ; cin>>t; while(t--) solve(); return 0; } int pow(int a, int b) { int res=1; while(b) { if(b&1) res=(res*a)%M; a=(a*a)%M; b>>=1; } return res; } int invm(int a) { return pow(a,M-2); }
run
|
edit
|
history
|
help
0
multiply_without_asterisk
Nieparzyste w macierzy
Test
completeBubbleSort
Median of two sorted arrays
OperatorOverload
inversion of array using merge sort
string match2
FindMissingBinom
Virtuals