Nice Explanation

Inputf.in: file not recognized: File truncated Showing this while giving input

hy brother please give google drive link

Lovely explanation for B

Build system not showing CP file

Literally thanks bro greedy approach let's go

there no cp in build system

latest update course hai ?

I cant able use the path to search I just installed minGW How to add it to path

#define int long long int void solve(){ int n,c;cin>>n>>c; int sos=0,soi=0; for(int i=0;i<n;i++){ int a;cin>>a; sos+=(a*a); soi+=a; } long long d = sqrt((soi*soi-n*(sos-c))); int ans = -soi+d; cout<<ans/(2*n)<<endl; } why solving quadratic roots is not a good idea. Thanks

Thanks a lot! Your explanation is very easy to understand.

just starting with cp these sort of video helps a lot

Great job man

great explanation buddyyyy

the google doc is not working

Thanks a lot for your help

cf id????

❤

C solution: void solve(){ int n; cin>>n; string s; cin>>s; map<int,int> mp; for(auto &i: s) mp[i]++; priority_queue<pair<int,char>> pq; for(auto i: mp){ pq.push({ i.second, i.first }); } vector<string> a; int num = pq.top().first; char ch = pq.top().ss; pq.pop(); forn(i,0,num){ string s; s += ch; a.pb(s); } int ind = 0; while(!pq.empty()){ char ch = pq.top().ss; int num = pq.top().ff; while(num > 0){ a[ind] += ch; num--; ind = (ind + 1) % (a.size()); } pq.pop(); } string ans = ""; for(auto i: a) ans += i; cout<<ans<<' '; return; } ---------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------- D solution: void solve(){ int x; int m; cin >> x >> m; int secMex = 0; while(x--){ int n; cin>>n; set<int> s; forn(i,0,n) { int x; cin>>x; s.insert(x); } int num = 0; int cnt = 0; while(cnt < 2){ if(s.count(num) == 0){ s.insert(num); secMex = max(secMex, num); cnt++; } num++; } } if(m < secMex) { int ans = secMex*(m + 1); cout<<ans<<' '; }else{ int ans = secMex*(secMex + 1); int greater = ((m*(m+1))/2) - ((secMex*(secMex+1))/2); cout<<ans+greater<<' '; } }

nice explanation 🤩

Expected difficulty level of D and E?

bro do you have Angela Yu course 100 days of code or any good mean stack or any of his course ?? pls let me know she is an amazing mentor

good explaination

nice explanation bro keep it up

nice explanation bhaiya

Hey bro , could you make a video on how to get started with competitive programming? It would be great if you could also share how you manage to solve all four questions in LeetCode contests, along with tips for improving problem-solving skills and practicing effectively. If making a video isn't possible, a detailed reply would be much appreciated!

I have doubt in e can't I right bottom as min(n,i+k-1)

good job

D solution: void solve(){ int n; cin>>n; vi a(n); forn(i,0,n) cin>>a[i]; string s; cin>>s; vector<int> pre(n, 0); pre[0] = a[0]; for(int i=1; i<n; i++){ pre[i] = pre[i-1] + a[i]; } int sum = 0; int i = 0; int j = n-1; while(i < j){ if(s[i] == 'R') i++; else if(s[j] == 'L') j--; else{ sum += pre[j]; if(i-1 >= 0) sum -= pre[i-1]; i++; j--; } } cout<<sum<<' '; } ------------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------------ E solution: void solve(){ int n, m, k; cin >> n >> m >> k; int w; cin >> w; vector<int> heights(w); for (int i = 0; i < w; ++i) { cin >> heights[i]; } sort(rall(heights)); vector<int> contributions(n * m, 0); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { int top = max(0ll, i - k + 1); int bottom = min(n - k, i); int left = max(0ll, j - k + 1); int right = min(m - k, j); // cout<<top<<' '<<bottom<<' '<<left<<' '<<right<<' ' int count = (bottom - top + 1) * (right - left + 1); contributions[i * m + j] = count; } } sort(contributions.begin(), contributions.end(), greater<int>()); int max_spectacle = 0; int len = min(w, (int)contributions.size()); for (int i = 0; i < len; ++i) { max_spectacle += heights[i] * contributions[i]; } cout << max_spectacle << endl; }

B solution: void solve(){ int n; cin>>n; vi a(n); forn(i,0,n) cin>>a[i]; for(int i=0; i<n-1; i++){ swap(a[i], a[i+1]); } for(auto i: a){ cout<<i<<' '; } cout<<' '; } ------------------------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------------------------ C solution: int vMed(vector<int> t, int n){ return t[(n - 1) / 2]; } int Med(int a[], int n){ return a[(n - 1) / 2]; } bool check(int x, int a[], int b[], int n, int k){ int targ = (n - 1) / 2 + 1; int s = 0, cnt = 0; for(int i=n-2; i>=0; i--){ if(a[i] >= x){ cnt++; if(cnt >= targ){ break; } } else{ if(b[i]){ s += x - a[i]; cnt++; if(s > k){ return false; } if(cnt >= targ){ break; } } } } return (s <= k and cnt >= targ); } void solve(){ int n, k; cin >> n >> k; int a[n], b[n]; bool haveOne = false; pair<int, int> t[n]; for(int i = 0; i < n; i++){ cin >> t[i].ff; } for(int i = 0; i < n; i++){ cin >> t[i].ss; } sort(t, t + n); for(int i = 0; i < n; i++){ a[i] = t[i].ff; b[i] = t[i].ss; haveOne |= b[i]; } int ans1 = 0; if(haveOne){ for(int i = n - 1; i>=0; i--){ if(b[i]){ vector<int> t; t.pb(a[i] + k); for(int j = 0; j < n; j++){ if(i == j){ continue; } t.pb(a[j]); } sort(all(t)); ans1 = vMed(t, n - 1) + t[n - 1]; break; } } } else{ cout << a[n - 1] + Med(a, n - 1) << endl; return; } int l = 0; int r = 1e10; while(l+1 < r){ int m = (l+r)/2; if(check(m, a, b, n ,k)) l = m; else r = m; } for(int i = 0; i < n - 1; i++){ if(b[i] and a[i] < l){ a[i] = l; } } sort(a, a+n); int ans2 = a[n - 1] + Med(a, n - 1); cout << max(ans1, ans2) << endl; }

the google doc in the description is not working

Mingw setup problem what to do

what is wrong in this int main() { int t; cin >> t; while (t--) { int n; cin>>n; string s; cin>>s; int c=0; for(int i=0;i<n;i++){ if(s[i]=='('){ c++; }else if(s[i]==')'){ c--; }else{ if(c>=1){ s[i]=')'; c--; }else{ c=1; s[i]='('; } } } stack<char>st; ll ans=0; for(int i=0;i<n;i++){ if(s[i]=='('){ st.push(i); }else{ if(!st.empty()){ ans+=i-st.top(); st.pop(); } } } cout<<ans<<endl; } }

nice share

bro it's asking for decryption key can u pls provide it the course is really helpful

B solution: void solve(){ int n; cin>>n; vs a(2); cin>>a[0]; cin>>a[1]; int cnt = 0; for(int i=2; i<n; i++){ if(a[0][i-2] == '.' and a[1][i-2] == 'x' and a[0][i-1] == '.' and a[1][i-1] == '.' and a[0][i] == '.' and a[1][i] == 'x'){ cnt++; }else if(a[0][i-2] == 'x' and a[1][i-2] == '.' and a[0][i-1] == '.' and a[1][i-1] == '.' and a[0][i] == 'x' and a[1][i] == '.'){ cnt++; } } cout<<cnt<<' '; } C solution: void solve(){ int n; cin >> n; string s; cin >> s; int cnt = 0; for (int i = 0; i < n; i++) { if (s[i] == '(') { cnt++; } else if (s[i] == ')') { cnt--; } else { if (cnt >= 1) { s[i] = ')'; cnt--; } else { cnt = 1; s[i] = '('; } } } vector<int> st; int ans = 0; for (int i = 0; i < n; i++) { if (s[i] == '(') { st.push_back(i); } else { ans += i - st.back(); st.pop_back(); } } cout << ans << endl; } D solution: void dfs(int k,int fa, vector<vi> &v, vi &minn, vi &a) { bool check=1; for(auto now : v[k]) { if(now==fa) continue; check=0; dfs(now, k, v, minn, a); minn[k]=min(minn[k],minn[now]); } if(check) minn[k]=a[k]; if(k==1||minn[k]<=a[k]) return; minn[k]=(minn[k]+a[k])/2; return; } void solve() { int n; cin>>n; vi minn(n+1, 1e9); vi a(n+1); vector<vi> v(n+1); for(int i=1;i<=n;i++) cin>>a[i]; for(int i=2;i<=n;i++){ int x; cin>>x; v[i].pb(x); v[x].pb(i); } dfs(1,-1, v, minn, a); cout<<a[1]+minn[1]<<" "; return; }

nicely explained

error after ctrl+b The system cannot find the file specified. [Finished in 334ms]

why n - cnt ??

Bro hindi me bol le agar english nahi boli jaati no offense but solution is good, but communication too matters. Yahan hindi ki public bhi aati hai, tere videos chalenge

nice explanation

b solution: void solve(){ int n, m; cin >> n >> m; vi arr(n); forn(i,0,n) cin>>arr[i]; vi arr2(n); forn(i,0,n) cin>>arr2[i]; map<int, int> mp; for (int i = 0; i < n; i++) { mp[arr[i]] += arr2[i]; } int ans = 0; for (auto &i : mp){ int p1 = i.first; int cs1 = i.second; int count1 = m / p1; int x = 0; int mon = m; int m1 = 0; x += p1 * min(count1, cs1); m1 = min(count1, cs1); mon -= p1 * min(count1, cs1); int y =x; int mon_ = mon; if (mp.find(p1 + 1) != mp.end()) { int am2 = mp[p1 + 1]; int am3 = mon_ / (p1 + 1); x += (p1 + 1) * min(am2, am3); mon_ -= (p1 + 1) * min(am2, am3); if(mon_ > 0){ if(am3 < am2){ int left = am2-am3; int aa = min(mon_, left); x += min(m1,aa); } } } ans = max(x, ans); } cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; using ll = long long int; using vi = vector<ll>; using vc = vector<char>; using vvi = vector<vector<ll>>; using vvc = vector<vector<char>>; using vb = vector<bool>; using vvb = vector<vector<bool>>; using vs = vector<string>; using pll = pair<ll, ll>; using mii = map<ll, ll>; using vii = vector<pair<ll, ll>>; #define int long long int #define gcd(a, b) __gcd(a, b) #define lcm(a, b) (1ll * (a / gcd(a, b)) * b) #define all(a) a.begin(), a.end() #define rall(a) a.end(), a.begin() #define f(i, a, b) for (int i = a; i < b; i++) #define rf(i, a, b) for (int i = a; i >= b; i--) #define ceildiv(a, b) ((a + b - 1) / b) #define pb push_back #define mp make_pair #define lb lower_bound #define ub upper_bound #define re return const int MOD = 1e9 + 7; const int MAX = 2e5; int dp = 1e9; #define inp(arr) \ for (auto &it : arr) \ cin >> it; void solve() { int n; cin >> n; vi arr(n - 1); inp(arr); vi ans; int k = n * (n + 1) / 2; f(i, 0, n - 1) { if (arr[i] > k) { cout << "No" << endl; re; } } if (arr.back() != k) { arr.pb(k); arr.insert(arr.begin(), 0); f(i, 1, n + 1) { ans.pb(arr[i] - arr[i - 1]); } set<int> st; vi res; f(i, 1, n + 1) st.insert(i); for (auto &el : ans) { if (st.find(el) != st.end()) { st.erase(el); } else { res.pb(el); } } if (st.empty()) { cout << "YES" << endl; } else cout << "NO" << endl; re; } else { arr.insert(arr.begin(), 0); f(i, 1, n) { ans.pb(arr[i] - arr[i - 1]); } set<int> st; vi res; f(i, 1, n + 1) st.insert(i); for (auto &el : ans) { if (st.find(el) != st.end()) { st.erase(el); } else { res.pb(el); } } if (res[0] == accumulate(all(st), 0)) { cout << "YES" << endl; re; } else cout << "NO" << endl; re; } } signed main() { int t; cin >> t; while (t--) { solve(); } return 0; }

code of 3 please provide

in third que , in your example test 17:42 case how 9 can be part of MAD subarray(int 3rd line) if it is occuring only once in previous array frequency >= 2 nah ?

In the third question if values were values are 3333221 the it won't be areenged in non decreasing order

In Second Question (B.Array Craft)... Instead of taking -1 and 1 alternative if we write -1 always. Will it give write ans??

Bro, great Explanation!!

bhai pattern wale question nhi ho paate div 2 ka c jabki div 3 ka e ho jate h

if you print matrix into reverse order then the center element will not change its position wrong approach