00:01
Hello, everyone.
00:01
So now i will be going over the third problem within chapter one, and it's asking to write a program that displays the pattern of spelling out fun, where the f is only made of fs, the u's, the u's are only made of u's, and the n is only made of ends.
00:15
So again, we're going to use print statements.
00:18
It looks like we're going to have these multiple print statements.
00:20
And the easiest way to do this is you see that the fun in the problem, there's how many rows? there's one, two, three, four, five, five, rows, so five rows of fs, five rows of u's, and five rows of ends.
00:34
So the easiest way to kind of set up the problem is to have five been statements.
00:40
And so now what we want to do is we see that there are six fs to begin with it.
00:46
Right.
00:47
And so now what i'm going to do is i'm going to get the f first, go onto the u and then get the f.
00:52
We see that there's two fs next and then there are another six fs, three, six.
01:00
And then there's two.
01:01
And then there's two.
01:02
So now it's compile and see we have an cool.
01:05
So now we need to calculate out the spaces.
01:09
And to me, it kind of looks like there's three between the six apps.
01:15
So one, two, three, and then i'm going to put a u.
01:18
And here i'm going to put one, two, three, then a u.
01:22
And for the sanctity, i'm going to line up this u here.
01:27
And then to get that kind of u shape, i'm going to do one here and then go on further.
01:33
And so now finally, what i'm going to do is there should be three u's here...