isValidTri.cpp. On paper, sketch out a solution for Programming Exercise 3.1, p. 98. This solution outline comprises your
algorithm to solve the problem (the algorithm does not have to be turned in).
Your program must generate the
I/O specification shown on p. 98. Note that it
echos the program inputs, which is our standard practice in 122. You may use integer inputs as shown.
By default Boolean values are represented using numbers,
0 for
false and
1 for
true. To print
these values as words read about the
boolalpha flag. Use of this flag is a P2 requirement.
Translate your algorithm into a c++ program,
isValidTri.cpp. Verify it by hand tracing it on several test cases (inputs). This handwritten program outline does not have to be turned in.
When you are confident of your program's correctness, use Visual C++ to edit/compile/test/debug your program.
Store your program as
/122/p2/isValidTri.cpp on your local host. When complete use SSH/sftp to upload it (drag-and-drop is all it takes) to your
/122/p2/ folder on the remote host,
shell.uoregon.edu.