Bora Demirtas

Пікірлер

@namanmishra6204 7 күн бұрын

can you suggest a learning source to make videos like this?

@BoraDemirtas 7 күн бұрын

www.manim.community/ is good to get started

@danieldiaz855 8 күн бұрын

Thank you for the effort, this is really a high quality tutorial!

@freebookstore3242 8 күн бұрын

is good explanation

@pawn2pawn 8 күн бұрын

For problem C1, the answer exists only when the most significant bit of both x and y is a set bit. So instead of running the loop from y = 1, we can run from y = 2 ^ (log2(x)).

@aankie 8 күн бұрын

sorry i dont want to hurt, its so difficult for me to grasp your accent

@sazid1183 8 күн бұрын

Really loved your work, bruh! especially the animation!!!

@ketansuman5732 9 күн бұрын

appreciate your hardwork brother

@SaiDharahasReddyIndrakanti 9 күн бұрын

in the second question are we solving it by looking only for distinct character substring ? is it because if the substring length is made odd with unique charcaters we can have even no of distinct substrings

@BoraDemirtas 9 күн бұрын

Yeah if we have 3 unique characters next to each other, f(p) will will be even. Take the string abc the substrings will be "a", "b", "c", "ab", "bc", "abc". That is 6 in total. The other case is when two same characters are next to each other. Take the string "aa" the two substrings are "a" and "aa".

@nullchilly 9 күн бұрын

Borz

@BoraDemirtas 9 күн бұрын

WOW!!!

@abhinavennala9613 9 күн бұрын

Thanks for the editorial

@sababmuhammad4842 9 күн бұрын

excellent video & explanation

@andreaskonstantinou008 9 күн бұрын

Wow. This is the best quality video discussing cf solutions I have ever seen.

@emes396 17 күн бұрын

I was not be able to understant the solves. But your video helped me, Thanks :)

@RafieAdrian Ай бұрын

Goated bro 🔥🔥 (best editorial i’ve ever seen)

@kartiknagrale1479 Ай бұрын

wow ++respect

@hardikpatel352 Ай бұрын

good efforts, thanks a lot

@singleslit2024ICPCgrind Ай бұрын

If you keep doing this, i can swear on god within. no time you would be the most popular figure in the CP industry.

@subhashisbhanjdeo1320 Ай бұрын

Problem A--- but the max array C=[7,7,7] and min B=[4,4,4] and after calculation 2+2+2=6 ??

@subhashisbhanjdeo1320 Ай бұрын

pls some explain me @BoraDemirtas?

@BoraDemirtas Ай бұрын

@@subhashisbhanjdeo1320 for what array would max array C=[7,7,7] and min B=[4,4,4]? That cannot happen because c[0] and b[0] have to be equal.

@clashersamir1625 Ай бұрын

great work, keep it up

@WebSleek Ай бұрын

love ur content pls be regular and explain little bit slowly😅

@AnkitMishra-vv8zy Ай бұрын

Answer of follow up question : Summation 1 to n (3/7)power (n-1) * ( 4/7) Please Let me Know If i am Correct

@thecheem3764 Ай бұрын

Everything about this video is amazing! However, can you perhaps invest more in the mic? For slow learners like me, channels like this really help, once again thanks a lot!

@Beingamanforever Ай бұрын

Awesome editorial

@lukevideckis2260 Ай бұрын

thanks

@BoraDemirtas Ай бұрын

@chinmay.sharma Ай бұрын

These animations are really cool! Great Work

@BoraDemirtas Ай бұрын

Thx sir

@harshavardan9054 Ай бұрын

Is it possible to make these editorials for next contests also

@BoraDemirtas Ай бұрын

I would if authors/coordinators invited me lol

@italk-gj5kk Ай бұрын

amazing animation!!

@pxnishant Ай бұрын

crazy tutorial, crazy efforts. thank you, amazing work!

@BucketPotato Ай бұрын

study this.

@BoraDemirtas Ай бұрын

WOW!!!

@jagannathan1014 Ай бұрын

I have been a video editorialist for some non-CF contests, and I can without a doubt say that the sheer effort put into this is beyond extraordinary. Thank you!

@BoraDemirtas Ай бұрын

thanks sir

@srijansinha7177 Ай бұрын

Great animations, man! They really helped me visualize. Thanks!

@BoraDemirtas Ай бұрын

Thanks for the kind words sir

@aankie Ай бұрын

Why are you that fast making tutorial?😍

@BoraDemirtas Ай бұрын

I've spent almost all of my free time for the past 5 days doing this and it came to like 1.5k lines of manim.

@armu8977 Ай бұрын

Can you send those combinatorics links

@BoraDemirtas Ай бұрын

it is in the description but here codeforces.com/blog/entry/78873

@kimjong-un4521 Ай бұрын

Nice editorials

@BoraDemirtas Ай бұрын

@daveshub 3 ай бұрын

Great video. But it did sound like you were feeling sleepy during recording. Nonetheless I really look forward to another one from you. PS: I subscribed.

@subhashsuryawanshi8820 5 ай бұрын

How did you come up with the diff = y - x%y;

@BoraDemirtas 5 ай бұрын

we will do the division operation when x is divisible by y we want to figure out how many times we will increment x before it is divisible by y currently the remainder is = x%y if we add diff + x%y to get our new remainder after incrementing x by diff times , we get: y - x%y + x%y = y and trivially y is divisible by y

@LakshyaIIITD 5 ай бұрын

For this problem I think greedy approach Is more intuitive than Dynamic Programming Approach. Well Nice Explanation

@akashverma7429 5 ай бұрын

Cool editorial, wanna see these videos becoming regular

@mzrubgwofcnghsomcvf 5 ай бұрын

orz, thank you for your effort. how much time did it took you. Does the process of making this kind of editorial get faster after each iteration?

@BoraDemirtas 5 ай бұрын

1. this one took 12ish hours 2. last one took 25ish hours but i haven't made enough to conclusively say anything

@kshitiz6376 5 ай бұрын

Thanks a lot for this.

@ShakhrukhRakhimov 5 ай бұрын

bro pls your videos are wonderfool so can you do editorial in each contest. it will be very good for you and for you subscribers : ) Who is agree like pls ; )

@imafraidjumitebeeinnagang3886 5 ай бұрын

This is beautiful

@BoraDemirtas 5 ай бұрын

thx

@victimizier 5 ай бұрын

i think we need to put if (prefix[x] - prefix[i] <= r && prefix[x] - prefix[i] >= l) another and condition in if to ge t correct ans.

@BoraDemirtas 5 ай бұрын

hi, we don't need the prefix[x] - prefix[i] >= l part because the lower_bound function already makes sure this is true

@victimizier 5 ай бұрын

@@BoraDemirtas ok thanks man

@victimizier 5 ай бұрын

cool explanation bro

@itzz_ayush8230 5 ай бұрын

thankyou

@amusefanatic8164 5 ай бұрын

nice explanations in very short time Thanks

@Avighna 5 ай бұрын

This is *really* cool, Manim editorials are like the highest quality haha.

@Idk-os4ix 5 ай бұрын

int n,l,r; cin>>n>>l>>r; vector<int>a(n); for(auto &ele:a) cin>>ele; long long sum = 0; int ans = 0; for(int i=0;i<n;i++){ sum += a[i]; if(sum >= l && sum <= r){ ans++; sum = 0; } else if(sum > r){ if(a[i]>= l && a[i]<=r){ ans++; } sum = 0; } } cout<<ans<<endl; could u explain why this code is failing? i tried debugging but it is not working out

@shantanuagarwal1029 5 ай бұрын

Hey ! My logic was also the same and my code was also failing :( ! Have u got the reason that why it is failing?

@zzz2753 5 ай бұрын

5:43 could you please help, didn't understand what we did with the lower bound function here

@BoraDemirtas 5 ай бұрын

it returns the first index that an array is greater than or equal to a specified value

@mehdi_ba13 5 ай бұрын

:D Thank youu

Ең жақсы KZbin

Пікірлер