20 | Pupil @CodeForces | Growth https://xitter.cf/t.co/2QNQr4hRMP | NSUT'29 CSE(IOT)
Mars
Joined May 2025
- Tweets11K
- Following321
- Followers969
- Likes43.7K
Harsh Jain retweeted
if any brand wants to work with me to promote their product, here's a demo of the traction i can bring.
my DMs are always open.
Harsh Jain retweeted
भरत भाई को मोदी परिवार की ओर से Codeforces पर Expert बनने की हार्दिक बधाई! 🎉🎉
हम आशा करते हैं कि आप जल्द ही CM की कुर्सी भी जीतकर हमारे परिवार, देश और अपने BADE भाई @mohitsatitwt का नाम रोशन करेंगे।
जय श्री राम! जय मोदी परिवार! 🚩😎
@HelloitsBharat
Harsh Jain retweeted
Congrats @HelloitsBharat real goat on X
Mai apne bacho ko bharat jaisa banaunga 😼✊
Harsh Jain retweeted
Finally became expert on CF🎉
Took me 2+ years but yeahh it was all worth it.
Thanks to everyone who congratulated me.
Learned from @Priyansh_31Dec and @striver_79 so big thanks to them.
All the decent questions sent by today will be answered.
Fir unhe answer karte hi app delete 🙂↔️
Let me try this things as well 😋
DSA, CP, problem solving keyword dikhte hi ignore kar dunga 🥰
tellonym.me/harsh338
Day 4 ✅
The idea was to first find the total cost each node is contributing and then minimise it optimally using DP on trees (simple take, not take type dp).
- For each route used one of the end points and started dfs from that node to update freq of all nodes in that path.
🧵
- Since 2^50 brute force will give TLE, so we have to use DP with 2 states :
1. Min cost of entire sub tree rooted at node 'i' if we half the curr node
2. Min cost of entire sub tree rooted at node 'i' if we keep curr node as it is
Write easy peasy transitions for them 😋
My submission : leetcode.com/problems/minimi…
Mai nhi hu bhai ye 😭😭
if anyone wants to confess something to me, now’s your chance..
do it here 👀
tellonym.me/divyansh.ama/don…