9AM in Florence, Italy (Doing Codeforces)

Added: 2026-05-31

[00:00:00]Reporting live from Florence, Italy.

[00:00:05]This is the birthplace of the Renaissance and one of probably the most artistic city I've ever been to. It really looks like they prioritize artists and fund them and encourage it.

[00:00:20]This is also the duomo. This is the y'all played Assassin's Creed.

[00:00:27]Let me show So you can see this is this church is actually amazing. This church is one of the most beautiful churches I've ever seen.

[00:00:37]>> And then if you ever played Assassin's Creed that's the that's the dome.

[00:00:45]But you can see this place is just lined up with artists.

[00:00:48]Artists everywhere around the city art. There's a lot of really good museums.

[00:00:57]There's a lot of good street singing and dancing. This place is a very fun city.

[00:01:02]So, so far I visited Athens.

[00:01:07]I've visited Athens. I've visited Hold up.

[00:01:12]So, y'all can see me code while while the dome is in the background.

[00:01:18]But yeah, this city really prioritizes art. You can tell it's a beautiful city. artists everywhere. It's hot. It's 32 degrees Celsius. It gets up to 34, 35. I mean, the food is good. It's busy. This This church is beautiful as well. Like, I went to Barcelona and I saw all the the nice churches there for sure. They were nice, but I really like the Italian style. Also, even with Italian art, you could tell or you could see a difference between the Italian art and all the other art I've seen in in Spain, France, etc. It's definitely different. I noticed it right away. And I actually really like Italian art. This church is one of the most beautiful churches I ever see. Probably the second next to the the one in Spain.

[00:02:11]But yeah, so far I've been to Athens. I was in Venice.

[00:02:17]I was in Santorini.

[00:02:20]Now Florence and I'm about to head to Rome in a couple hours. But Florence has to be top two. Venice and Florence is Yeah, those are my top two cities right now. But I mean, y'all came here for some leak code, so I got some cappuccino.

[00:02:38]I got cappu ice cappuccino this time for real. not a espresso. But yeah, definitely would recommend Florence to anybody visiting Italy. This place is beautiful and it motivated me a lot. Um, but if you're in art or anything like that, this is the place to be. You'll get a lot of inspiration. Even though I'm not even an art, not really an artist, still was very inspired visiting here. So, I mean, let's just run some people real quick.

[00:03:15]recording.

[00:03:18]Probably do like a 20 to 25 minute session.

[00:03:23]I removed my background noise filter so y'all can just hear the city cuz um hear the sounds of the city. Everyone's trying to get into the cathedral. But look how nice this cathedral is.

[00:03:38]>> Very beautiful.

[00:03:41]restaurants.

[00:03:46]It's like streets are busy. It's 9:00 a.m. in the morning.

[00:03:54]Look at this church. I don't know if this is the best angle. I don't know if y'all think this is looking nice, too.

[00:04:00]But yeah, Satis Creek Dome.

[00:04:04]Such a beautiful city. Definitely would come back.

[00:04:12]definitely would come back here and and and just spend a month doing code forces and trying to get the code forces grandmaster from here. I think this is like a optimal setup.

[00:04:26]Get the dome in the back. I'm getting saved by this tree. It's really hard.

[00:04:29]But let's let's grant some questions real quick.

[00:04:40]I also ordered a chocolate croissant.

[00:04:43]So, I'm just waiting on that.

[00:04:49]So, given a string X of length N and a string S of length M consisting of lowerase L letters, you can apply any number of operations to the string X.

[00:05:02]In one operation, you can append the current value of x to the end of the string x. Note that the value of x will change after this.

[00:05:13]Given this given a string x of length n and a string s of length m, you can append the current value of x to the end of the string x. Note that the value of x will change after this. For example, if ABA then after applying X operations, you'll get ABA. AB Okay, after what minimum number of operations S will that number of operations S will appear in After what minimum number of operations S will appear in X as a string as a substring? A continuous substring of a string is defined as continuous segment of it.

[00:05:55]negative. You return negative one if it's impossible.

[00:06:03]>> Okay, >> now let's take a look. So, this one, let's put this to the side.

[00:06:15]And I love just hitting random cities and doing code courses.

[00:06:21]>> I wish I could make this a full-time job. This Um, there you go.

[00:06:47]So, we're given a So what's the input?

[00:06:59]I think we're given the first line contains n and m. The second line is x and second is s. How many times can we append x to itself to get s? I mean this case it's just five. The output should be five or three I guess cuz in the first operation go a then a then we add a a again loud but I I got to I got to leave it running the so y'all can hear what the city is like. So now S is in there. So it's three.

[00:07:53]One, two, three. I mean the brute force force would just be to try to pen and check the substrate.

[00:08:12]>> When will it not work? Let's look at the We have to look at all edge cases. when it would not work.

[00:08:23]So in this case, we get X.

[00:08:27]I noticed that's one thing that that's going to help me move faster cuz I was watching some of my film and I realized that if I do both CA if I do the the passing case and the failure case, I could probably get to the solution a lot faster.

[00:08:44]AB AB AV one. Two.

[00:09:03]>> How does this not work?

[00:09:06]>> That should be one, two.

[00:09:13]signing.

[00:09:14]>> Okay. When does it not work?

[00:09:39]>> Yeah.

[00:09:50]Yeah, it it just becomes an extension.

[00:09:52]What is like X Y X Y Z XYZ?

[00:09:59]left cuz you so this you just need to see you you need you basically need to you basically need to see if X is a repeating sequence of S. See if S is a repeating sequence of X.

[00:10:52]So, what I would do is probably just take X and expand it out until it's greater than or equal to and then check if it exists.

[00:11:02]Let me try to get the Wi-Fi to see if this this works. All right, connected to Wi-Fi so I could actually run my test cases. But what we'll do is we're just going to expand out. So, pretend this is X. We'll just expand it out until it's greater than or equal to the size of A.

[00:11:22]And then we'll just see if S is in X.

[00:11:29]So we can do just a string builder. So that'll be o. So we're going to do is we're going to let's let's copy our input from one of the other ones.

[00:11:44]Going to go ask for my croissant soon.

[00:11:53]So what we're going to do is this is the number of tests and then for tests we're going to get the input cuz we don't really care about the first one. For the second one we're going to get S and then we're also going to get X or we're going to get X and we're going to get S.

[00:12:36]We got enough. So what we're going to do is um while length s is greater than length x what we're going to do is x plus = x if s if x's easy one See?

[00:13:23]>> Oh, we need to print the number of times.

[00:13:46]I think we we can do something like this.

[00:14:22]What happened here?

[00:14:29]Let me just make sure I'm capturing the input correctly.

[00:14:51]Let's make sure we're capturing the input correctly. A at the cost.

[00:15:10]>> What funny Three.

[00:15:40]Okay, that work.

[00:15:50]Oh, wait. Did I read it wrong?

[00:16:08]Got the back machine.

[00:16:30]Wow.

[00:16:43]this edge case cuz we just add force and then it gets there after.

[00:17:02]>> So just that would just be zero right here.

[00:17:23]Let's see if this Let's see if this brute force just works.

[00:17:46]Okay, let's work to this example. What if I I didn't see this edge case, but what if we start off with E4s and then our job is needs to be at least four. It's one hit.

[00:18:15]texture tickets.

[00:18:26]>> Maybe we could just Is there a time that we can get Okay, it's not that easy as I thought.

[00:18:47]Where disappears.

[00:19:18]Well, okay. This the insight. It can be two. It can be it could be rotated and still work. So, what's the rotated case? So, if we have XYZ, right?

[00:19:36]This is so at ts S X is so S is target. X needs to be uh repeating repeating substring.

[00:20:27]We should be able to partition S with X.

[00:20:43]I think we can just brute force this. So what we're going to do is while the length of S is greater than equal to as if it's some sort of rotating X.

[00:21:06]So say x = y zx and s is equal to xyz xyz.

[00:21:23]So once we take x and we go that could eventually equal.

[00:21:44]>> So if it's rotated, it'll equal we I think we got to rotate it. Do we have to rotate it or just just keep trying?

[00:22:03]start.

[00:22:10]>> Okay, I think we just need to capture the two cases. But what we'll do is we'll just brute force this. If the length is greater than if the length of x So we'll do is if then we need to be able to break while S is in X three.

[00:23:06]Something like this.

[00:23:16]21gative one.

[00:23:19]Why did this kiss? One, two, three.

[00:23:23]One, two, three, four.

[00:23:28]There's a mismatch here.

[00:23:32]One, two, three, four, five.

[00:24:01]I feel like we're approaching this question wrong.

[00:24:06]We're approaching this question wrong.

[00:24:13]Okay. What's this case?

[00:24:18]My nose is runny and still a little bit sick.

[00:24:29]Okay. What's this case? We have X.

[00:24:40]Thank you.

[00:25:14]How do we handle this case?

[00:25:17]Feel like it needs to just be some rotation. It needs to be.

[00:25:30]Yeah, this this case breaks cuz S is already greater than but actually it can start off greater than and then you could add it. So I think you just need to if it's greater than And finally they do this.

[00:26:27]>> He got So, I'm like >> going to try this out and then we're going to turn three.

[00:27:09]How am I getting folded by this?

[00:27:15]Okay, how let's let's try to look at this from a different perspective. I feel like it needs to be like some rotation.

[00:27:42]Just one case, too.

[00:27:47]>> I feel like we need to do one case.

[00:27:56]forces.

[00:27:58]>> Yes.

[00:28:25]If temp equals If temp equals If temp equals Okay.

[00:28:45]Oh, how do we do this?

[00:29:05]What the heck?

[00:29:32]Good bro.

[00:29:45]Know what result is this?

[00:29:58]312 one zero almost.

[00:30:07]What?

[00:30:32]That was just not worth supposed to go here.

[00:31:26]How am I getting folded?

[00:31:30]Embarrassing myself over here.

[00:31:36]>> Yeah, I'm not doing this correctly.

[00:31:47]always.

[00:32:28]Okay. Damn, I only got to one question.

[00:32:32]Okay, we're going to fight through going to fight through what is abstring at this.

[00:32:56]>> So there's X 1 2 3 4 5. 1 2 5.

[00:33:42]I >> feel like you just have to keep expanding it for like some number of iterations.

[00:33:49]Maybe like let's just go. Let's just restart length x.

[00:34:06]How much times does x go into s and take the ceiling of that?

[00:34:18]For this case, one goes into two twice plus one.

[00:34:26]One, two, where we're going to take S.

[00:34:59]X. So >> how much times can S be divided by X?

[00:35:05]So if it's six, then we take the seal of that seal plus one.

[00:35:41]question.

[00:36:01]scene. I looked at this completely wrong. So, chat, let me know how y'all would solve this. Scene equals true.

[00:36:36]This just straight. I tried to maybe overoptimize it.

[00:36:45]probably tried to over optimize it, but okay, let's admit this.

[00:36:51]>> All right, let's admit this.

[00:36:56]>> Hopefully I don't TLE.

[00:37:06]>> Hopefully I don't TLE.

[00:37:09]But TLE, I'm calling it. It's all good.

[00:37:16]All right, we got to look at this a different way.

[00:37:21]I got to I got to catch my How do we look at this?

[00:37:28]We're looking at this completely wrong though.

[00:37:33]What is this question?

[00:37:41]Yeah, we're looking at this completely wrong.

[00:37:46]>> Or maybe this is what one of those ones that you could only solve using C++ cuz the string manipulation.

[00:38:16]It's all ash is always not greater than five. Why wouldn't >> I would not be able to solve that.

[00:38:39]I I wouldn't have came up with that to just run it on five. I wonder what test case I'm I was breaking on.

[00:38:55]Now you This is why a lot of code forces people really look at the constraints.

[00:39:01]Huh.

[00:39:02]I don't know if I'd be able to I would have been able to get that.

[00:39:08]See, accepted.

[00:39:11]Holy that that question put us through it. But look how beautiful this city is.

[00:39:17]One last time for you. Look at all the artists lined up.

[00:39:29]>> All right.

[00:39:32]All right, going to head to Rome and I'm going to do this again in Rome. But thanks for tuning in. Catch y'all in the next video. Peace.