SCPC11D - Egypt
A long time ago, the Egyptians figured out that a triangle with sides of length 3, 4, and 5 had a right angle as its largest angle. You must determine if other triangles have a similar property.
Input
Input represents several test cases, followed by a line containing 0 0 0. Each test case has three positive integers, less than 30,000, denoting the lengths of the sides of a triangle.
Output
For each test case, a line containing "right" if the triangle is a right triangle, and a line containing "wrong" if the triangle is not a right triangle.
Example
Input:6 8 1025 52 606 8 10 25 52 60 5 12 13 0 0 05 12 130 0 0Output: right wrong right
hide comments
|
Hawari Rahman:
2011-10-25 04:51:56
I don't get it, do we have to make a testcase or not ? Also if the input is 0 0 0 do we have to break the program ? |
|
numerix:
2011-10-24 16:59:57
If you like that kind of problem, you may want to try this one in SPOJ's Shortening Contest:
|
|
Chandan Giri:
2011-10-21 10:04:37
tutorial level!!! |
|
MR. BEAN :
2011-10-19 13:44:29
tutorial problem!!! Last edit: 2011-11-05 06:37:22 |
|
[Rampage] Blue.Mary:
2011-10-19 11:07:17
It already exists: http://www.spoj.pl/problems/GAME31/.
|
|
Ali Arous:
2011-10-19 11:02:16
thank you for putting it in classical problems section , i was afraid of it's difficulty level and expected that someone else would move it to tutorial.
|
|
|
[Rampage] Blue.Mary:
2011-10-19 10:11:13
Yes, I got 2 WA's on B because of my wrong understanding. BTW, I think put 1 problem of a complete contest into tutorial section is not so good. |
|
|
Ali Arous:
2011-10-19 09:59:24
This was the easiest problem in SCPC-2011
|
| Added by: | Ali Arous |
| Date: | 2011-10-18 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
| Resource: | Syrian Collegiate Programming Contest 2011 |
RSS