Module: (C++) Loop statement with condition - while


Problem

21 /21


Maximum and minimum

Problem

Given a sequence of non-zero integers ending in zero (zero is not included in the sequence). It is necessary to find the distance (modulo) between the first minimum and the first maximum number of the sequence.
Input: integers (one number per line) are input
Output: print the answer to the problem

Example
№ Input Output
1 -1
-2
1
7
2
0		 2

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!