5224: Triangular
[Creator : ]
Description
Determine whether a triangle can be built from a given set of edges.
An array A consisting of N integers is given. A triplet (P, Q, R) istriangularif 0 ≤ P < Q < R < N and:
A[0] = 10
A[1] = 2
A[2] = 5
A[3] = 1
A[4] = 8
A[5] = 20
Triplet (0, 2, 4) is triangular.
array A such that:
A[0] = 10
A[1] = 50
A[2] = 5
A[3] = 1
the function should return 0.
An array A consisting of N integers is given. A triplet (P, Q, R) istriangularif 0 ≤ P < Q < R < N and:
- A[P] + A[Q] > A[R],
- A[Q] + A[R] > A[P],
- A[R] + A[P] > A[Q].
A[0] = 10
A[1] = 2
A[2] = 5
A[3] = 1
A[4] = 8
A[5] = 20
Triplet (0, 2, 4) is triangular.
array A such that:
A[0] = 10
A[1] = 50
A[2] = 5
A[3] = 1
the function should return 0.
Input
First line, a number N.
Second line, N numbers.
Second line, N numbers.
Output
Returns 1 if there exists a triangular triplet for this array and returns 0 otherwise.
Sample 1 Input
6
10 2 5 1 8 20
Sample 1 Output
1