I need a programmer who is good with C++. I have a task which involves programming and sending me the solutions. Here is the case study below:
Your task is to implement a robot war, in which a large number of robots, grouped into several teams, move around in 2-dimensional space. Your program will read as input two files, start.txt and commands.txt, and produce output on the standard output. The format of these files is described below, but you should create your own for testing purposes. Your submissions will be run against several different input combinations.
The initial state of the system is described by a file start.txt, each line of which will contain four numbers identifying a robot, its team, and its initial position, e.g.
1673 2 53 -89 This says that robot 1673 belongs to team 2 and starts with x-coordinate 53 and y-coordinate -89. Robots and teams are indentified by positive whole numbers; coordinates are also whole numbers, but may be negative. You may assume that each robot is specified only once, and that each robot starts out in a different position.
At any time, each robot will be facing north, east, south or west. All robots start off facing north. We assume a conventional 2-dimensional space, so one step north from (53, -89) is (53, -88), while one step east would be (54, -89).
The program should then read commands.txt, acting on each line as it is read. The lines have the following forms and meanings, where r stands for a robot number. If the named robot does not exist, the command should be silently ignored.
show
The program should print to the standard output the current positions of all the robots still in the system, in the same format as start.txt above, but in ascending order of robot number.
travelled
List all the robots in the system, each with the total distance it has travelled. For example, if a robot has moved north 3 steps, east 1 step, and then south 2 steps, it has moved a total of 6 steps, even though it is only 2 positions from where it started.
Each line of the output should consist of two numbers, the robot number and the distance travelled, and they should be in increasing order of distance travelled. If two robots have travelled the same distance, order them by robot number.
within n
Print out the number of robots within n steps of the origin. (That is, the distance is n or less.) You should print the number on a line by itself, with no extra text. Distance here is the sum of the absolute values of the x- and y-coordinates (the Manhattan metric), so the distance to (2, -5) is 7.
turnleft r
Make robot r turn to the left, e.g. if it is facing north, turn it to face west.
turnright r
Make robot r turn to the right, e.g. if it is facing north, turn it to face east.
move r
Attempt to move robot r one step in the direction it is facing. If the target location is already occupied by a robot on the same team, no move is possible, and the robot stays where it was. If the target location is occupied by a robot of another team, that robot should be removed from the system, after which our robot moves.
You may assume that both files are correctly formatted: there is no need for your program to check for incorrect input.
Your program should not produce any other output than the above. If you add extra output statements during testing, be sure to remove them before submission. If you have added a pause before the program exits, please remove that too. (A better approach would be to configure your IDE to automatically pause so you don't need it in your program.)
Nessus Advanced Windows Support Category: Computer Security, Internet Security, Network Administration, Technical Writing, Web Security Budget: $10 - $30 AUD
