Hello and welcome back.
In this video, we are going to try see for so let's run it first and see what he does.
OK.
Right, click here and open coming in.
And this type CIFOR without any parameters, so we ask you to provide the secret password.
So will provide us with
trees and you says, come on now, you should expect better from us, so let's give it a longer password,
maybe five years or more.
Still not long enough.
So an even longer possible.
And now we know that it is quite a long password, more than five characters, but it's still around.
So if you want to give this a try, please post a video first.
All right, so this is how I resolve it, how you seem to impart this into Ghidorah.
Sorry for.
He's an Alpha 64 bit.
OK.
Draghi truly could rally to start the analysis process.
Bitcoin, yes.
And click on Analise.
Watch.
He's all right and he has finished analyzing.
So let's go to the Functions folder and look for the main function and click on.
This is the main function, but it's the wrong signature, so that is Aditi.
Change the first parameter to Hoxsey in the second one to Char starts to harkavy.
Now you will see it expects at least one parameter
in exactly one parameter.
So maybe supply no barometer, this test failed because oxes won and he showed it this message from
here, and if it's applied to be sent by one parameter, then Occy, he exactly two.
And so he went in here and it's said that the length of our part of it, I'm the one he's referring
to this possibly a tie means as we are to e lengths and let's rename it.
And then now see if the light is less than 10, then you show this bad message, which is this one,
come on, so on.
So this suggests that the length of the password is ten characters or more.
So if you supply 10 characters now,
one, two, three, four, five, six, seven, eight nine, 10 zero zero password because of this wrong
password.
So in here, he's going to do a while and he's going to use a variable.
And this variable, look at him, he's set to zero before he enters the wire loop and this variable
click on, he will highlight all the places it is being used.
And if you look down here, we can see that this guy is incremented by one at the end of the loop and
it goes back up here to check again.
He was less than the length.
Then he will continue to look.
And inside the loop, first line, he is Tassie's.
He checks about this every element.
Plus two is not equal to this realignment you enter from the Pacific.
So this suggests that local 18 isn't really next, so we can rename it.
Array index,
an array indexes is the way in which you assess each of the characters in the string.
So, for example, here how that here is a string star in C programming.
You can create a string like this.
And then to assess each of the three elements you can do, for example, you can give a name.
You can do things like this.
String Zero is referring to character H.
And then string one is referring to character, a song.
You can also do things like this.
String zero three zero is also referring to character age, and that is what you are seeing here three
nights so early next, when you first enter, salute is zero.
So because it is zero, it is comparing each with something before he does that plus two.
So it is actually taking age and incrementing by two so each becomes G.
Remember, he is asking
if you go to ASCII tables and look at each.
Is one year for if you're plus two can become six one zero six, which is due.
So, Cindy, if you are comparing one, that means you are taking a impasto, as you can see, so it
applies to his G, C, then C plus two is he came close to him A he do to see the plus.
Do we have a do we see why.
Plus do what is and why.
Plus two, if you compare the back to why in the ASCII table and look for it as equal to one, two,
one and then you plus two it becomes a one, two, three which is a left race is connected similarly.
What his dash plus two dash plus to this dash plus two gives you forward slash.
And finally, you press Tooheys, have you?
So this algorithm algorithm is a method of solution to solve a problem.
So this algorithm is actually taking every character of this tree and converting it, shifting it by
two simple Hecate that you will actually become GCM, CFC, culebras, forest slash.
So this is the password.
So it is merely comparing every characteristic with your password that you enter.
Now, more money finds any character which is wrong.
It was your own password he will not see in the rest of the loop.
So this is what this group is doing.
This argument, one ugly one is your password.
They enter.
So the array next year is also assessing every character of the password you enter.
So this is how it works.
So that is try this and see this.
Correct.
So that is beneath typing your password, which.
It's Masowe.
GCM, KSE.
To see he and she see.
Left back forward.
Let me carry you into the right basement.
So this is how you solve this challenge.
This challenge requires you to understand re indexing every indexing, how you assess each element of
a string using his index.
So once you understand this, you can understand this line of code.
He also requires you to understand ASCII code, which we have covered the previous ACIN.
So that's how you solve it.
Thank you for watching.
I'll see you in the next one.