Intervals (1)

Write a program that, given two intervals, computes the interval corresponding to their intersection, or tells that it is empty.

Input

Input consists of four integer numbers a1a_1, b1b_1, a2a_2, b2b_2 that represent the intervals [a1,b1][a_1,b_1] and [a2,b2][a_2,b_2]. Assume a1b1a_1\le b_1 and a2b2a_2\le b_2.

Output

Print “[]” if their intersection is empty, or “[xx,yy]” if this is their non-empty intersection.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T11:05:15.908Z

© Jutge.org, 2006–2026.
https://jutge.org