DMOPC '19 Contest 6 P0 - Trivial Math

View as PDF

Submit solution


Points: 3
Time limit: 2.0s
Memory limit: 256M

Author:
Problem types
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

You are given three positive integers, a, b, c, such that a,b,c \le 1\,000\,000. Determine whether a triangle of non-zero area can be formed with a, b, and c as side lengths.

Input Specification

The input consists of a single line with integers a, b, c separated by spaces.

Output Specification

Output on a single line, yes if a valid triangle can be formed.
If a valid triangle can not be formed, output no.

Note: an invalid triangle in this case is one that does not satisfy the strict triangle inequality.

Sample Input 1

1 2 3

Sample Output 1

no

Sample Input 2

1 2 2

Sample Output 2

yes

Comments

There are no comments at the moment.