![aryanc403](/img/default-banner.jpg)
- Видео 101
- Просмотров 237 732
aryanc403
Индия
Добавлен 6 мар 2019
I'm Aryan. I started doing CP ~6 years ago (I did a JEE grind ~2 years before that). I have participated in a lot of contests in these 6 years. I had an opportunity to participate in ICPC World Finals (as a last-minute replacement for someone else) and CodeChef Snackdown World Finals.
In the ICPC World Finals, my team became the first Indian team to be crowned Asia West Champion by virtue of the best rank among Asia West teams. In Snackdown World Finals, I was 3rd in the Indian ranklist among ~35 Indian finalists. These are some of my achievements I'm proud of.
Apart from doing CP, I have been on the other side of the panel as well, preparing and testing problems for ICPC regionals, Indian IOITC, CodeChef, CodeForces contests, etc.
On the professional side, I graduated in 2021 and currently work as a Software Engineer in one of the MNCs. I don't have any experience in teaching people, but I'm working on developing it, too.
In the ICPC World Finals, my team became the first Indian team to be crowned Asia West Champion by virtue of the best rank among Asia West teams. In Snackdown World Finals, I was 3rd in the Indian ranklist among ~35 Indian finalists. These are some of my achievements I'm proud of.
Apart from doing CP, I have been on the other side of the panel as well, preparing and testing problems for ICPC regionals, Indian IOITC, CodeChef, CodeForces contests, etc.
On the professional side, I graduated in 2021 and currently work as a Software Engineer in one of the MNCs. I don't have any experience in teaching people, but I'm working on developing it, too.
How to bruteforce game theory problems using CF Edu problem
This is a clip from my post contest discussion stream for codeforces education round 169.
I'm adding it as a separate video so that I can refer people to this video whenever a new problems comes up.
Codeforces problem - codeforces.com/contest/2004/problem/E
ABC368F is another such problems which requires only bruteforce.
atcoder.jp/contests/abc368/tasks/abc368_f
Also checkout ""Winning Ways for Your Mathematical Plays V1"" book for more examples of nim games.
I'm adding it as a separate video so that I can refer people to this video whenever a new problems comes up.
Codeforces problem - codeforces.com/contest/2004/problem/E
ABC368F is another such problems which requires only bruteforce.
atcoder.jp/contests/abc368/tasks/abc368_f
Also checkout ""Winning Ways for Your Mathematical Plays V1"" book for more examples of nim games.
Просмотров: 1 385
Видео
Codeforces Educational Round 169 Solution Discussion | ABCDEF
Просмотров 2,5 тыс.21 день назад
Codeforces Educational Round 169 Solution Discussion | ABCDEF My submissions - codeforces.com/submissions/aryanc403/contest/2004 Community discord server - discord.gg/HKFgRWmWNY LinkedIn - www.linkedin.com/in/yt403 Twitter - aryanc403 Chapters - 00:00:00 Testing 00:02:20 A. Closest Point 00:13:30 B. Game with Doors 00:26:00 C. Splitting Items 00:36:00 D. Colored Portals 00:50:00 E. ...
How to install atcoder library
Просмотров 1,7 тыс.Месяц назад
My blog - aryanc403.com/blog/installing-atcoder-library/ Community discord server - discord.gg/HKFgRWmWNY LinkedIn - www.linkedin.com/in/yt403 Twitter - aryanc403 Tags - #icpc #ioi #codeforces #codeforcessolution #codeforcessolutions #codechef #codechefsolution #codechefsolutiontoday #atcoder #geekforgeeks #topcoder#hackerearth #hackerrank #hackerranksolution #hackerranksolutions #l...
#Atcoder #ABC 345 "E - Colorful Subsequence" Editorial (By #AIR #1)
Просмотров 9625 месяцев назад
#Atcoder #ABC 345 "E - Colorful Subsequence" Editorial (By #AIR #1)
#Codeforces round 930 "Bitwise Operation Wizard" Editorial
Просмотров 1,2 тыс.6 месяцев назад
#Codeforces round 930 "Bitwise Operation Wizard" Editorial
#Codeforces round 930 "Shuffle Party" Editorial
Просмотров 1,2 тыс.6 месяцев назад
#Codeforces round 930 "Shuffle Party" Editorial
#Codeforces round 930 "Pokémon Arena" Editorial
Просмотров 5606 месяцев назад
#Codeforces round 930 "Pokémon Arena" Editorial
#Codeforces think-cell round 1 C. "Lexicographically Largest" editorial
Просмотров 2,5 тыс.6 месяцев назад
#Codeforces think-cell round 1 C. "Lexicographically Largest" editorial
#Codeforces think-cell round 1 A. "Maximise The Score" editorial
Просмотров 3496 месяцев назад
#Codeforces think-cell round 1 A. "Maximise The Score" editorial
#Codeforces think-cell round 1 B. "Permutation Printing" editorial
Просмотров 1,1 тыс.6 месяцев назад
#Codeforces think-cell round 1 B. "Permutation Printing" editorial
#StopPostContestHacking How to play cat and mouse game ft leetcode contests (and a shadow ban)
Просмотров 7306 месяцев назад
#StopPostContestHacking How to play cat and mouse game ft leetcode contests (and a shadow ban)
Bro why no video on atcoder abc 370
Thank you bhaiya for your efforts
Hi, can you share your build and test process?
Thanks:) Problem B: 10:14 Problem D: 20:00
You're doing an amazing job. Keep up the great work
That solution for E was great!
leetcode or codeforces
Everything is really good explaination but I can not understand the H question .. is there anyone who can help me out from that
In last question, why did u initialize l for binary search=-1 instead of 0 as median>=0. I wasn't getting right answer with l=0. Thanks for the explanation btw !!
thanks alot bro I get really good approach from your channel
1:05:27 this mint (atcoder library) allowed in ICPC or not (also on codechef and leetcode as well)
Why would it be disallowed lmao?
Bro I started attempting codeforces, after watching your videos.thank you for your such a nice explanation.
Keep it up
@@aryanc403 When will you start a series (playlist)on DSA
I still don't understand the 3rd case in problem F. how did expected value of 1 2 3 4 5 became 500000012 ?
For that you have to study what modulo inverse is and how does it works. For that test case answer would be 17/2 and in question it was stated that if your answer is in fraction (p/q form) the you have to print value of p * q-¹ where q-¹ is modulo of q so answer would be 17 * 2-¹ = 50000012
The answer is 85/10. The problem statement asks us to print a integer 0<=X<mod, such that (10*X) % mod = 85. 500000012 is the integer between [0,mod-1] such that if we multiply it by 10 and take mod, we will get 85. How to find such integers for other fractions? Checkout modular arithmetic section here usaco.guide/gold/modular
Sir if possible can u pls explain java code too..
honestly logic is enough if you code in any language. btw i also do cp in java
Your stream is mostly watched by 1200 below rated coders, it would really help if you start your solution by first explaining a test case and then doing a dry run over your solution that would really be helpful and please go a bit slow for questions after d(e,f,g...) for div3 and after b(c,d...) in div2, you just need to understand why is your stream not watched by enough even after so many newbies in the contest something needs to change in your style otherwise blatantly giving out solution won't help and your channel would remain stagnant.
Thank you for the feedback. I will try doing better.
@@aryanc403 sir how u proof ur solution in contest?
@@aryanc403 One more suggestion if you could write the code without using the templates that you use in the code(that is like instead of using vi for vector<int> use the whole) that can improve the understanding of the code for the people who are watching your stream for the first time.
@@sourabhtiwari4788 i feel like implementation should be done entirely on your own, his code can serve as a reference here and there. But if you understand the algorithm, you should be able to code it entirely on your own.
why gcd==0? can't we write? ke whole array GCF ==1 then it's always possible ke array ko ham 0 to n-1 bana sakte
It was added before there was a change in constraints. We do not need a check for gcd==0.
@@aryanc403 okk now we only need for gcd 1 na ? since it's now a[i]>=1
For problem E I didn't attempted because I thought O(t x 26 x n) will timeout as t is too high
Problem statement has a line - “sum of n over all testcases is .....” With t*n you are essentially computing the same thing. So you can replace t*n with 2e5 and overall time complexity becomes 2e5*26
to be honest jis level pe app ho , apka minimum 1m subs hone chahiye , but ye duniya , kya karein bhaiya , acche log ka kadar hi nhi hai , faltu content me million , billion view aate hai
where is error in this code void func(){ int a, b; cin>>a>>b; if(a&1){ no; return; } a/=2; if(b<=a){ yes; }else if(b>a){ b = abs(b-a); if((b&1)==0) yes; else no; }else no; }
I wrote the same code dude
@@sarthak9932 still getting failed testcase in 2
why are you doing b = abs(b-a) and comparing a and b values, thodi intuition explain karo
A=4, B=8
A=2 B=4. Your code returns no as 4-2/2 = 3 which is odd. However 1 - 2 + 2 - 2 + 2 - 1 is possible. The problem is you never considered the case where 1 and 1 can simply cancel out each other (without having to depend on 2s) Your code fails for any even b>= 2*a when a is a oddx2 For example your code fails on a=6 b=12 too
Can the last problem be also solved using small to large merging? Thanks for wonderful explanation !
Maybe one can, but the problem does not need anything more than single dfs.
That thumbnail picture looks really nice👏👏
thanks for the valuable content !
for real, i have seen people discussing post contest but this man is just too good with it, his thought process and explanation is just sublime.
congrats\\\\\\\\\\\\\\\\\
Aryan level on cf when?
your new subscriber
Leetcode contest winner💥
can you do abc367 also?
Can you please make a video on selecting problems for practicing and which resources do you use learn for learning topics?
Worst explanation
In problem D1, it says you start with some element X but what exactly is that X? We don't really take anything X as input so how do we exactly guess what x to take?
please explain what you have written in contest do not code a new code while explaining it creates problem in understanding the code
Need a video on parallel binary search
Thanks for codeforces. Can you also do this for atcoder?
ruclips.net/p/PLY4qyBz7rQ86kKUmXmAcr8_FUyGIy7iJ2
@@aryanc403 Please do this for every Atcoder Beginner
sir D1 wala bilkul smjh mai nhi aya
u can ask me in cf id i can explain u there
In question C, we can store the characters along with their frequency without sorting and then keep popping the front element for one time and then the other element. This continues while size of q is greater than 1 and at last we can pop the last character. #include <bits/stdc++.h> using namespace std; #define ll long long int #define pp pair<int,char> int main() { ll t; cin>>t; while(t--) { ll n; cin>>n; string s; cin>>s; unordered_map<char,int> mp; for(auto &x : s) mp[x]++; queue<pp> pq; for(auto &x: mp) pq.push({x.second, x.first}); string st=""; while(pq.size()>1) { auto tp= pq.front(); pq.pop(); st.push_back(tp.second); if(tp.first-1>0) { auto tp1 = pq.front(); pq.pop(); st.push_back(tp1.second); pq.push({tp.first-1,tp.second}); if(tp1.first>1) pq.push({tp1.first-1,tp1.second}); } } if(pq.size()) { auto tp = pq.front(); pq.pop(); for(int i=0;i<tp.first;i++) st.push_back(tp.second); } cout<<st<<endl; } } This also shows accepted.
Yes this is another correct solution. Official editorial has this solution and a reason why it works. codeforces.com/blog/entry/132953
bhai yeh aapke baal pure white kaise ho gaye ek dum se ?
probably the lighting
Sir can you please continue doing this for upcoming codeforces contest as well?
I do this for almost every contest. :)
In google OA there was a question in which given a tree we needed to find sum of medians of all odd length path of the tree.. i tried solving it using ordered set but got TLE.. tips on how to solve it
Can someone suggest me like it took me almost 1 hour to hit the approach for the second one.
Number of question solve by you in today contest can send someone to depression 😢 but motivating at same time
Thanks a lot for this .
congratulations! nice performance today
Thank you very much!
Shreyan Ray the legend!!!!
Will u Atcoder regular contest solution?
Not planning to.
didnt know pedro pascal started cp
Amazing thank you so much
C: 8:30
plz add subtitle for better understanding.
bro this is live stream how he can add subtitles . #aryan sir orz
don't stop bro. Love from Bangladesh!
bro whats your rating? i am also from bd
@@HridoyNandi-cn3qk CF max 1122. you?
@@prantobala8505 1200 max
useful video,hope u do more vid like this