Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
MY NEW
/* author : masaow g++ : 17.3.20 */ #include <bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> #define forn(i,a,b) for( i = a ; i < b ; i++ ) #define debug(x) cout << #x << " " << x << " -- " #define I__O ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL) #define ll long long #define p(x) cout << x << "\n" ; #define MOD 100000007 #define pi pair<int,int> #define vi vector <int> #define pb push_back #define vp vector <pair<ll,ll>> #define endl cout << "\n" #define mi map <int,int> #define f1 first #define s1 second #define in insert #define all(x) x.begin(),x.end() using namespace std ; using namespace __gnu_pbds; typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set ; const int N = 2e5+7; /* time : 10 : 14 date : 24.02.2020 */ const int MOD = 1e9+7 ; // int L,R,mid,target,idx ; int tests() { return 0; } int main(){ I__O ; int cases = 1 ; //cin >> cases; while(cases--) tests(); return 0 ; }
run
|
edit
|
history
|
help
0
XD
queueArray
PointPattern
CheckSymbolBalance
HashRK
Lex cpp
ONP
input
Lowest common ancestor in binary tree
max subsequence of array