It is important to step the test numbers in some way so you know which order they are in. To review, open the file in an editor that reveals hidden Unicode characters. The answer is that the first input had to be 1. Make sure you update this. c = 1 At any point in time, the, tab-delimited file (./bomblab/scores.txt) contains the most recent, scores for each student. The first argument must be less than 7, right? I dont want to go through either solution all the way here, since the first one is a no-brainer and the second one is a little complicated. phase_2 Based on the first user inputed number, you enter into that indexed element of the array, which then gives you the index of the next element in the array, etc. phase_2 Subtract original pointer from %eax and get the running total of the string. mov a b moves data from a to b as opposed to b to a). Try this . So there are some potential strings for solving each of the stages. phase_6 A tag already exists with the provided branch name. to use Codespaces. You signed in with another tab or window. fun7 ??? From this, we can guess that to pass phase_1, we need to enter the correct string. Site design / logo 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. PHASE 3. I found various strings of interest. I hope it's helpful. Each phase expects you to type a particular string on stdin. As a next step, lets input the test string abcdef and take a look at what the loop does to it. without any ill effects. If the first character in the input string is anything but a zero then the detonation flag is set to low and passed out the function. Give 0 to ebp-4, which is used as sum of n0, n1, n2. Phase 2: loops. which to blow yourself up. Asking for help, clarification, or responding to other answers. A tag already exists with the provided branch name. As we can see, it is fairly obvious that there is a loop somewhere in this function (by following the arrows). There exists a linked list structure under these codes. More than 2 is fine but the code is only dependent on the first two numbers. First, to figure out that the program wants a string as an input. Then enter this command. In this exercise, we have a binary whose source we do not have. First, interesting sections/function names: I try a input sequence "aaaaaa" and get the value after transitions doesn't change at all, which means that the output of a given input is unique.