Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
temp_new
#include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> typedef long long int ll; typedef long double ld; using namespace std; using namespace __gnu_pbds; #define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); #define ordered_set tree<pair<ll,ll>,null_type, less<pair<ll,ll> >, rb_tree_tag, tree_order_statistics_node_update> ///order_set two command:order_of_key,find_by_order ll MOD=1000000007; int main() { fast; }
run
|
edit
|
history
|
help
0
Value equal to index value
CutRod(BottomUp)
Two-phase sample with GCC
Jilebi Nimki
D. Traveling Graph
26 და 28 მარტს დამუშავებული
Fungsi
HCF
Graph Theory 2
Functions-Part I