Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
template
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll, ll> #define vll vector<ll> #define vpll vector<pll> #define pb push_back #define mk make_pair #define f first #define s second #define mem(a,b) memset(a,(b),sizeof(a)) #define rep(p,q,r) for(int p=q;p<r;p++) #define repr(p,q,r) for(int p=q;p>=r;p--) #define mod 1000000007 inline size_t key(int i,int j) {return (size_t) i << 32 | (unsigned int) j;} ll max(ll a, ll b){ return a > b ? a : b; } ll min(ll a, ll b){ return a < b ? a : b; } int main() { return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
iviewb
CIDP2k19
basic observation leads to dp OPTIMIZATION from O(n^3) to O(n^2) !!! (sopj : AMBLE)
Meeting_Leandro
Generating π from 1,000 random numbers
basic caculate i
ONP
Patara asoebi
static_cast makes a copy
MINVEST
Please log in to post a comment.