Indian ICPC Camp
0:26
10 ай бұрын
CodeCrafts Session 9
48:33
11 ай бұрын
CodeCrafts Session 8
1:04:04
11 ай бұрын
CodeCrafts Session 7
57:50
11 ай бұрын
CodeCrafts Session 6
56:12
11 ай бұрын
Video Editorial CCC round #1
53:17
11 ай бұрын
CodeCrafts Session 5
1:10:03
Жыл бұрын
CodeCrafts Session 4
1:05:47
Жыл бұрын
CodeCrafts Session 3
1:33:10
Жыл бұрын
CodeCrafts Session 1
1:09:16
Жыл бұрын
Codecrafts Session 2
1:34:19
Жыл бұрын
Пікірлер
@priyanshkumariitd
@priyanshkumariitd 6 күн бұрын
Thanks for explanation of D
@dewsara2888
@dewsara2888 11 күн бұрын
Thanks a lot.
@shresthveersingh6715
@shresthveersingh6715 19 күн бұрын
The qr for attendance was not opening what to do now?? I tried scanning it many times but it did not
@shekharsawarni
@shekharsawarni 21 күн бұрын
Can you post these test in KZbin community so that we can also compete in these tests thank you
@Ahryno781
@Ahryno781 23 күн бұрын
Is this competitive programming?
@pranavraghu
@pranavraghu 22 күн бұрын
No, these are topics essential for software development
@user-iq1et7ec7d
@user-iq1et7ec7d 24 күн бұрын
pls make the session 2 of code craft as public on youtube it is showing private @ProgrammingClubIITM pls reply
@Alok_ih
@Alok_ih 28 күн бұрын
Hey guys Thnx for this, is there any kind of discord or WhatsApp group that even we can join, also can we join Codeforces Group ?
@Dineshkumar-uz4dw
@Dineshkumar-uz4dw Ай бұрын
Nice explanation
@Ahryno781
@Ahryno781 Ай бұрын
why E is always hard
@parasjeeprep3206
@parasjeeprep3206 Ай бұрын
regular video dalo please love from iit Ropar
@mrunalmustapure3661
@mrunalmustapure3661 Ай бұрын
Awesome video :)
@okay_ocus1031
@okay_ocus1031 Ай бұрын
Can you guys please work on your accent and work on making a concise, yet explanatory editorial
@alokitmishra4482
@alokitmishra4482 Ай бұрын
Great video understood the concept ❤
@VISHALSHARMA-nf7kl
@VISHALSHARMA-nf7kl 3 ай бұрын
I watched the video for problem E, it was very nice explanation.
@whoamI-ht4op
@whoamI-ht4op 5 ай бұрын
Good one
@rushirajralebhat4786
@rushirajralebhat4786 5 ай бұрын
Itadori yuji 🦆
@harveycrimsond3947
@harveycrimsond3947 10 ай бұрын
Hey, Since you u guys know from experience. Is it realistic to expect to become a master on CF in 14 months if you practice 10-12 hours a day ?
@arinbalyan1182
@arinbalyan1182 10 ай бұрын
@arinbalyan1182
@arinbalyan1182 10 ай бұрын
plz put some more informative video .Loved your video❤.
@serius074
@serius074 10 ай бұрын
never ever stop this please🤗
@40_suppakrit_wanggripsukon3
@40_suppakrit_wanggripsukon3 10 ай бұрын
Thank you for very much for the problem E explanation. It really helps
@ang4633
@ang4633 10 ай бұрын
you are awesome, funny, smart, your content is best keep it up
@shiv3992
@shiv3992 11 ай бұрын
oRz
@haricharanbalasundaram3124
@haricharanbalasundaram3124 11 ай бұрын
Since this is the first time we're conducting this kind of camp, we're starting small and strong, so we have decided to restrict our attention to participants from the above colleges. In subsequent iterations, we'll ensure that it's open for people from all colleges.
@harshmittal6461
@harshmittal6461 11 ай бұрын
Okay, I'll be waiting eagerly for the subsequent event.
@jayyuv6079
@jayyuv6079 11 ай бұрын
Why aren't people from other Institutions not invited? I do believe it will help anyone who's interested if they learn from people who're already good in the field. Well regardless, good luck and have fun.
@laconic7119
@laconic7119 11 ай бұрын
how to register ?
@harshmittal6461
@harshmittal6461 11 ай бұрын
someone not from these colleges can participate? and if yes then how to register
@anshumanmoharana5019
@anshumanmoharana5019 11 ай бұрын
How to register please explain
@mith_jain_here
@mith_jain_here 11 ай бұрын
Can breadth first traversal also be applied for the last question?
@keyenter123
@keyenter123 11 ай бұрын
Thanks
@mahadevusudheer6966
@mahadevusudheer6966 11 ай бұрын
Hello, in problem D, i2 is in for-loop of 0<=i2<=n-1. How does i2+1 work when i2 = n-1 in the last iteration? Can you pls explain?
@raghuvanshsiddharth9048
@raghuvanshsiddharth9048 11 ай бұрын
In the E problem why did you multiplied n with the 4w^2 thing. I couldn't get it 😅
@haricharanbalasundaram3124
@haricharanbalasundaram3124 11 ай бұрын
4w^2 is summed over all the different pieces, so sum (4w^2) = 4 w^2 n
@raghuvanshsiddharth9048
@raghuvanshsiddharth9048 11 ай бұрын
@@haricharanbalasundaram3124 Oh it's similar to integration of a constant. Got it thanks❤
@haricharanbalasundaram3124
@haricharanbalasundaram3124 11 ай бұрын
@@raghuvanshsiddharth9048 Welcome!
@prithwirajmitra3811
@prithwirajmitra3811 Жыл бұрын
E2 Code gives WA on testcase 23. Plz check
@skzahirulislam2820
@skzahirulislam2820 Жыл бұрын
Maybe you are wasting your time doing cp instead learn web developement or ai/ml
@shivamchauhan029nitjsr4
@shivamchauhan029nitjsr4 Жыл бұрын
8:29 current_sum value is not changing.. it will result in wrong answer (Correct me, if i'm wrong)
@raadheschandaluru5801
@raadheschandaluru5801 Жыл бұрын
You are correct , i have corrected this in my slides , thank you for pointing it out .
@clashtm8210
@clashtm8210 Жыл бұрын
Guys ek paytm account daaldo niche, accha mic ka jugaad hi hojaaye through donations
@nalinraj4347
@nalinraj4347 Жыл бұрын
which company is kaustabh is currently placed now?
@fun4ayush
@fun4ayush Жыл бұрын
Helpful session !!
@giit85
@giit85 Жыл бұрын
Great session Can you guy's some video's on problem solving on graph tree dp from basic to advanced
@shivamchauhan029nitjsr4
@shivamchauhan029nitjsr4 Жыл бұрын
Start from 12:08
@jeevansingh5170
@jeevansingh5170 Жыл бұрын
Could anyone explain why using in E2 - (sum > 1e18/k) we break? Why not sum can be greater than that
@haricharanbalasundaram3124
@haricharanbalasundaram3124 Жыл бұрын
They've given n <= 1e18 in the question.
@jeevansingh5170
@jeevansingh5170 Жыл бұрын
@@haricharanbalasundaram3124 Actually my doubt is why we are stopping at sum > 1e18/k, I think we should stop when sum > 1e18.
@haricharanbalasundaram3124
@haricharanbalasundaram3124 Жыл бұрын
@@jeevansingh5170 so if we're doing that, we'll have integer overflow... as in, if we use a very large value, say 1e18 * 1e6 or something, that'll overflow because long longs can only be till 1e18. To avoid that we're doing this.
@jeevansingh5170
@jeevansingh5170 Жыл бұрын
@@haricharanbalasundaram3124 Okay got it. thanks
@secondthread-uc9bd
@secondthread-uc9bd Жыл бұрын
​@@jeevansingh5170 its just sum * k > 10^18 , to prevent LHS overflow , write it that way.
@mohitmalik4610
@mohitmalik4610 Жыл бұрын
thanks for tutorial but please use time stamps
@Bharat_Rider
@Bharat_Rider Жыл бұрын
🙏 thx
@haricharanbalasundaram3124
@haricharanbalasundaram3124 Жыл бұрын
Welcome!
@vibhorkumar9771
@vibhorkumar9771 Жыл бұрын
in ques 3
@vibhorkumar9771
@vibhorkumar9771 Жыл бұрын
i cant understand how this code solves the condition when more than 1 player has same cnt values??? Is it because sorting it in decreading order will automatically first look for cnt and if it finds more than one player having same count than it automatically compares the pen values???
@haricharanbalasundaram3124
@haricharanbalasundaram3124 Жыл бұрын
Yeah, if the points value are equal, it checks the one with the smaller penalty value
@vibhorkumar9771
@vibhorkumar9771 Жыл бұрын
@@haricharanbalasundaram3124 thanks
@innocentzero9814
@innocentzero9814 Жыл бұрын
Awesome camp!!
@ayushmishra6575
@ayushmishra6575 Жыл бұрын
Amazing bro !! i used different approach for C but yours was better. Thanks
@programmingclub_iitm
@programmingclub_iitm Жыл бұрын
Thanks!
@mokshmangal9308
@mokshmangal9308 Жыл бұрын
Please jor se bolo
@programmingclub_iitm
@programmingclub_iitm Жыл бұрын
Sure, we'll try to fix that from next time
@yashjaiswal8161
@yashjaiswal8161 Жыл бұрын
No sound!!
@programmingclub_iitm
@programmingclub_iitm Жыл бұрын
Sure, we'll try to fix that from next time