0_0_32168230_22133.cpp:4:1: error: stray '\241' in program
Input contains several test cases followed by a line containing 0. Jimmy has numbered each intersection or joining of paths starting with 1. His office is numbered 1, and his house is numbered 2. The first line of each test case gives the number of intersections N, 1 < N ¡Ü 1000, and the number of paths M. The following M lines each contain a pair of intersections a b and an integer distance 1 ¡Ü d ¡Ü 1000000 indicating a path of length d between intersection a and a different intersection b. Jimmy may walk a path any direction he chooses. There is at most one path between any pair of intersections.
^
0_0_32168230_22133.cpp:4:1: error: stray '\334' in program
0_0_32168230_22133.cpp:4:1: error: stray '\241' in program
0_0_32168230_22133.cpp:4:1: error: stray '\334' in program
0_0_32168230_22133.cpp:4:1: error: stray '\241' in program
0_0_32168230_22133.cpp:4:1: error: stray '\334' in program
0_0_32168230_22133.cpp:1:1: error: 'Jimmy' does not name a type
Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A nice walk through the forest, seeing the birds and chipmunks is quite enjoyable.
^
|
