From 33957f1ef84c2872ca1a54f2d0532acbc1f9d807 Mon Sep 17 00:00:00 2001 From: ShazidMahsrafi Date: Sat, 31 Aug 2024 12:22:22 +0600 Subject: [PATCH] feat: Add solutions for Codeforces problems 2000 A, B, and 1440B --- Codes/1440 B - Sum of Medians/1440B.cpp | 56 ++ Codes/2007 A - Dora's Set/2007A.cpp | 51 ++ .../2007B.cpp | 60 ++ Readme.md | 575 +++++++++--------- 4 files changed, 456 insertions(+), 286 deletions(-) create mode 100644 Codes/1440 B - Sum of Medians/1440B.cpp create mode 100644 Codes/2007 A - Dora's Set/2007A.cpp create mode 100644 Codes/2007 B - Index and Maximum Value/2007B.cpp diff --git a/Codes/1440 B - Sum of Medians/1440B.cpp b/Codes/1440 B - Sum of Medians/1440B.cpp new file mode 100644 index 0000000..24155cb --- /dev/null +++ b/Codes/1440 B - Sum of Medians/1440B.cpp @@ -0,0 +1,56 @@ +#include +using namespace std; +#ifdef ONLINE_JUDGE +#define dbg(...) +#else +#include "Assets/debug.h" +#endif +#define int long long +#define ll long long +#define endl '\n' +#define ff first +#define ss second +#define ins insert +#define pb push_back +#define ppb pop_back +#define sz(x) (int)(x).size() +#define all(x) x.begin(), x.end() +#define rep(i,a,b) for(int i=a; i=b; --i) +#define yn(f) f? cout<<"YES\n":cout<<"NO\n" +#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr)); +ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} + +void solve() +{ + int n,k,a; + vectorv; + cin>>n>>k; + ll range = n*k,j = 0,div = 0,sum = 0; + div = n/2; + + for(ll i=0; i>a; + v.pb(a); + } + for(ll i=range-1-div; i>=0; i-=div+1){ + //cout<> TCS; + for (int TC = 1; TC <= TCS; ++TC) + { + // cout<<"Case "< +using namespace std; +#ifdef ONLINE_JUDGE +#define dbg(...) +#else +#include "Assets/debug.h" +#endif +#define int long long +#define ll long long +#define endl '\n' +#define ff first +#define ss second +#define ins insert +#define pb push_back +#define ppb pop_back +#define sz(x) (int)(x).size() +#define all(x) x.begin(), x.end() +#define rep(i,a,b) for(int i=a; i=b; --i) +#define yn(f) f? cout<<"YES\n":cout<<"NO\n" +#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr)); +ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} + +void solve() +{ + int l,r; + cin>>l>>r; + int ct=0; + for(int i=l; i<=r-2; ++i) + { + if(i&1) + { + dbg(i); + ct++; + i+=3; + } + } + cout<> TCS; + for (int TC = 1; TC <= TCS; ++TC) + { + // cout<<"Case "< +using namespace std; +#ifdef ONLINE_JUDGE +#define dbg(...) +#else +#include "Assets/debug.h" +#endif +#define int long long +#define ll long long +#define endl '\n' +#define ff first +#define ss second +#define ins insert +#define pb push_back +#define ppb pop_back +#define sz(x) (int)(x).size() +#define all(x) x.begin(), x.end() +#define rep(i,a,b) for(int i=a; i=b; --i) +#define yn(f) f? cout<<"YES\n":cout<<"NO\n" +#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr)); +ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} + +void solve() +{ + int n,m; + cin>>n>>m; + vectorv(n); + for(auto &i:v) cin>>i; + auto mx = *max_element(all(v)); + dbg(mx); + while(m--) + { + char c; + int l,r; + cin>>c>>l>>r; + if(c=='+') + { + if(mx<=r && mx>=l) mx++; + } + else + { + if(mx>=l && mx<=r) mx--; + } + cout<> TCS; + for (int TC = 1; TC <= TCS; ++TC) + { + // cout<<"Case "<