using Structures c++ and without build-in function

Segments compression method Cost: 3 Solved: O Memory limit: 256 Mb Time limit: 1000 ms Input file: stdin Output file: stdout Task: It was chosen to put two new bus routes on different sections (i.e. bus stops) of New Avenue to unload the traffic. Each bus stop is numerated. The first and last stops of each bus are known. Find the quantity of stops where you can change from one bus to another. Input: Four naturals - the numbers of the first and last bus stops: first two refer to the first bus, second two-to the second bus. Each number is not greater than 10% Output: The quantity of bus stops. Example: Input Output 3 6 4 2 2 3 1 5 10