Bifalgorithm post

We don't exactly want it to be just one hash at each line. We want the number of hashes based on the row. So the first one should be one hash, then two, then three, then four. So let's go ahead and make that. And I'm going to call it to be quite. I want to make it myself. So I'm going to call create a variable called hash count, which is going to be equal to I. But since I starting at zero, we want to add one. All right. And then here we can't just print. well I guess we could, right? So then here now let's just go and print hash count here. All right and this though is going to just print the number that we have, right? So there's going to be four hashes down here, three here, two here, one here, okay? But we don't want to print the hash count, we want to print how many hashes. So we need to build the row. So I'm going to create another thing and I'm going to variable and I'm going to call it row which is going to to be an empty string. And then I want to build what is going to be in that string by looping through the hash count. So we're going to say for J zero and then J less than hash count, because that is going to be how many characters we need in that row. J plus plus. All right. Let's just add the ashes now. Okay, so in our row, we're going to loop through how many hashes we need and we're going to add that amount of hashes. So let's see how we're doing here. So we're doing pretty good. So we have four, three, two, one.

We don't exactly want it to be just one hash at each line. We want the number of hashes based on the row. So the first one should be one hash, then two, then t…