Soft Labs

// Mergesort void merge ( ll arr [], ll lft , ll mid , ll rgt ){     ll n1 = mid - lft + 1 ;     ll n2 = rgt - mid ;     ll a [ n1 + 1 ];     ll b [ n2 + 1 ];     for (ll i = 0 ; i < n1 ; i ++ ){         a [ i ] = arr [ lft + i ];     }     for (ll i = 0 ; i < n2 ; i ++ ){         b [ i ] = arr [ mid + 1 + i ];     }     a [ n1 ] = b [ n2 ] = INT_MAX;     ll i1 = 0 ;     ll i2 = 0 ;     for (ll i = lft ; i <= rgt ; i ++ ){         if ( a [ i1 ] <= b [ i2 ]){             arr [ i ] = a [ i1 ];             i1 ++ ;         }         else {             arr [ i ] = b [ i2 ];             i2 ++ ;         } ...

//https://drive.google.com/drive/folders/1jpkE2jz0UaxAVG3gE6Itk6LbKEqWLDW5 #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std ; using namespace __gnu_pbds ; #define ordered_set tree < ll, null_type , less < ll > , rb_tree_tag , tree_order_statistics_node_update > //order_of_key (k) : Number of items strictly smaller than k . //find_by_order(k) : K-th element in a set (counting from zero). (returns to an iterator) #define ll long long int #define llu unsigned long long int #define pi 3.14159265359 #define lcm ( x , y ) (x / gcd (x, y)) * y #define sin ( x ) sin ((x / 180.0 ) * pi ) #define cos ( x ) cos ((x / 180.0 ) * pi ) #define tan ( x ) tan ((x / 180.0 ) * pi ) #define len ( x1 , y1 , x2 , y2 ) hypot (x1 - x2, y1 - y2) #define sorta ( v ) sort ( v . begin (), v . end ()) #define sortd ( v ) sort ( v . begin (), v . end (), greater <>()) #...

#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std ; using namespace __gnu_pbds ; #define ordered_set tree < ll, null_type , less < ll > , rb_tree_tag , tree_order_statistics_node_update > #define ll long long int #define llu unsigned long long int #define pi 3.14159265359 #define lcm ( x , y ) (x / gcd (x, y)) * y #define sin ( x ) sin ((x / 180.0 ) * pi ) #define cos ( x ) cos ((x / 180.0 ) * pi ) #define tan ( x ) tan ((x / 180.0 ) * pi ) #define len ( x1 , y1 , x2 , y2 ) hypot (x1 - x2, y1 - y2) #define sorta ( v ) sort ( v . begin (), v . end ()) #define sortd ( v ) sort ( v . begin (), v . end (), greater <>()) #define min_el ( v ) ( * min_element ((v). begin (), (v). end ())) #define max_el ( v ) ( * max_element ((v). begin (), (v). end ())) #define sum ( v ) ( accumulate ((v). begin (), (v). end (), 0 ll )) #define uniq ( v ) v . ...

  Privacy Policy for Soft.Labs Terms and Conditions Effective Date: 5/30/2024 1. Introduction Welcome to Fiverr Auto Reloader ("the App"). By using the App, you agree to comply with and be bound by these Terms and Conditions ("Terms"). If you do not agree to these Terms, please do not use the App. 2. No Data Collection 2.1 User Privacy: Fiverr Auto Reloader is committed to user privacy. We do not collect, store, or process any personal data from users. This includes, but is not limited to, usernames, passwords, email addresses, or any other personal information. 2.2 Data Integrity: Since no data is collected, users can be assured that their privacy is fully protected while using the App. There are no hidden data collection processes or background tracking mechanisms. 3. Use of the App 3.1 License: We grant you a limited, non-exclusive, non-transferable, and revocable license to use the App for personal, non-commercial purposes in accordance with these Terms. 3.2 Pr...