Codeforces Educational Round 172 (Div. 2) || Editorial for Problem A,B,C ✅

Рет қаралды 435

Күн бұрын

A. Greedy Monocarp || B. Game with Colored Marbles || C. Competitive Fishing
contest URL - codeforces.com...
Contact me
LinkedIn - / swapnil-tayal
Instagram - / swapnil_tayal
❌ Don't Click this link - / @nicspyy
🛒💻 Products I use
mic: shorturl.at/iDkis
Please Leave a like, as it takes so much effort to put up this quality of content for you guys! ❤
✨ Hashtags ✨
#Codeforces #CompetitiveProgramming #CodingTutorial #CPlusPlus #CPProblems #EducationalContent #Algorithm #ProgrammingChallenges #CodeforcesSolutions #Div2Contest #CodingEducation #LearnToCode #ProgrammingTips #CodingCommunity #AlgorithmicThinking #TechTutorial #CodingPractice #CodeforcesEditorial #codeforces #cp #cpp #educational #EducationalCodeforces #div3 #codeforcessolutions #editorial #educational #Codeforces172 #172 #codeforces #cp #cpp #educational #EducationalCodeforces #div2 #codeforcessolutions #editorial #educational #Codeforces172 #172
✨ Tags ✨
Codeforces contest 2030, Twice, Intercepted Inputs, Superultra's Favorite Permutation, Sharky Surfing, Competitive programming solutions, C++ coding tutorial, Algorithm explanations, Problem-solving strategies, Educational Codeforces, Div3 contest analysis, Coding challenges walkthrough, Tips for Codeforces contests, Competitive programming techniques, Learn C++ programming, Coding skills development, Programming community insights, Contest preparation strategies

Пікірлер: 5

@AsadKhan-rn8tz 2 ай бұрын

c can be done with just greedy?

@nicspyy 2 ай бұрын

@@AsadKhan-rn8tz yes tags were for greedy in the question

@nicspyy 2 ай бұрын

B solution: void solve(){ int n; cin>>n; vi a(n); forn(i,0,n) cin>>a[i]; map mp; for(auto i: a) mp[i]++; priority_queue pq; for(auto i: mp){ pq.push({i.ss, i.ff}); } vi alice, bob; int g = 0; map mpalice; while(!pq.empty()){ if(g == 0){ // couts; for(int i=0;i=0;i--){ a.pb(x); if(s[i]=='1') x++; else x--; } for(auto i: a) cout