Codeforces Round 946 (Div. 3) || Editorial for Problem A,B,C,D,E

[@prankershaha2978]

Brother pelease provide me drive link of 100 day phython Course by Dr angela yuu

[@nicspyy]

i tried to find it, but not able to on the same source where i find previous ones, by ya will try to find, if i got hand on that course

[@Predator-pv7of]

hey can you explain the second last test case of problem E

[@Predator-pv7of]

Like after the five months, he will have 12 bucks in his hand, so he can buy happiness of first, second, third and fifth month, and thus the total cost will be 11 and happiness 14?

[@nicspyy]

totaly forgot the context of the quesiton 🥲

[@harshmaheriya4416]

I have a dought in question 4 Can't we just maintain balance between the position of R and H EX ; Start with origin and move the R and H like this if( s[i]=='N' ){ if( y1=y2 ){ y1--; ans+='H';} else{ y2--;ans+='R';} }else if( s[i]=='E' ){ if( x1

[@nicspyy]

does it work?, but i guess its not generalized, there are cases in which it might not work

[@harshmaheriya4416]

It worked you have to make another 2 flag for h and r moved and when x1==x2 and other case you have to move which piece is not moved yet

[@nicspyy]

@@harshmaheriya4416 thats nice, 💯

[@nicspyy]

B solution: void solve(){ int n; cin>>n; string s; cin>>s; set st; for(auto i: s){ st.insert(i); } string str = ""; for(auto i: st) str += i; // cout