Search:

Ah i found it!


if(route[i+2]==destination)
{
printf("\nDestination Reached\n");
exit(EXIT_SUCCESS);
}

route[i+2] should be...

oh yeah i forgot to mention, the mines can only be placed at the dots in the map, not in the cross sections. But that isnt really the problem. The problem is that when i put 1 as source and 16 as...

Ah yes, your right. But that still didn't solve it :(

the robot is programmed in VHDL, if it finds a mine, it wil send a signal to the computer. That signal is "0" in my code. The mines are put in the map randomly.

Ok sorry about that, I'm going to edit it now.

Thanks a lot!

There is no correct answer. You just choose a starting point and an ending point. Dijkstra's algorithm will then give you the shortest path. From that path, I have to give the directions between each...

Solved, thanks :)

Ok, thanks i'm gonna try it out.

Ok, you you mean i can print the *p to get the ASCII representation?

Also i am using isdigit atm.

Sorry if seemed a bit rude, that wasnt the intention.

This is what i have now:

can you read my question again, i've edited it. I hope it more clear now.

the 135 was just a random number. Let's forget that i said that :P.

This assignment is for a parser. The input is some expression. I have to find the numbers in the expression and convert them to...

no, that was just a random integer. I have to show a number in the ASCII representation.

Hi,

I have to program a parser that parses expressions. The input is a string (an expression). I have to make a function called get_number. It checks if there are numbers in the string. Also to...

Hey,

I have to program the game yahtzee and at some point I have to check if the score selection is correct. It's correct if the input matches the score types and if the score isn't used already. ...