Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
new
#include <bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; using namespace std; #define ll long long #define ld long double #define F first #define S second #define sf(x) scanf("%d",&x) #define pf(x) printf("%d\n",x) #define ALL(x) x.begin(),x.end() #define pb push_back #define mp make_pair #define mod1 1000000007LL #define pii pair<int,int> #define mod2 998244353LL #define setbit(x) __builtin_popcount(x) typedef tree< pair<int, int>,null_type,less<pair<int, int> >,rb_tree_tag,tree_order_statistics_node_update> ordered_set; void solve(int test) { } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); //freopen("input.txt","r",stdin); int t=1 ; //cin>>t; while(t--) { solve(t); } return 0; }
run
|
edit
|
history
|
help
0
Proyecto 1
2
count pairs with given sum hashing
Exempel 2
Stream9
Dar
SEGMENTED SIEVE
Following order Indegree
Test1
an awesome question of basic graph traversal (786A)