# Nyist 31 5 count to calculate the maximum value

Source: Internet
Author: User

5. Calculate the maximum number.
Time Limit: 1000 MS | memory limit: 65535 KB
Difficulty: 1
Description
Design a program for getting the minimum and maximum numbers from five Integers
Input
The input contains only one set of test data, which is five positive integers not greater than 10 thousand.
Output
Output two numbers. The first is the minimum value of the five numbers, the second is the maximum value of the five numbers, and the two numbers are open in an empty space.
Sample Input
1 2 3 4 5 sample output
1 5

# Include <iostream>
Using namespace STD;
Int main ()
{
Int I, Max, Min, a ;

For (I = 0; I <5; I ++)
Cin> A [I];
Max = min = A ;
For (I = 0; I <5; I ++)
{
If (A [I]> MAX) max = A [I];
If (A [I] <min) min = A [I];
}

Cout <min <"" <max <Endl;

}

***************

# Include <stdio. h>
Int main ()
{
Int A, Max, Min, I;
Scanf ("% d", & );
Max = min =;
For (I = 1; I <= 5; I ++)
{
Scanf ("% d", & );
If (A <min)
{Min = ;}
If (A> MAX)
{Max = ;}

Printf ("% d \ n % d", Min, max );
Return 0;
}

}

*****************

*************************************

# Include <stdio. h>
Int main ()
{
Int A , I, Max, min;
For (I = 0; I <5; I ++)
{
Scanf ("% d", & A [I]);
}
Max = min = A ;
For (I = 1; I <5; I ++)
{
If (A [I] <min)
Min = A [I];
}
Printf ("% d", min );
For (I = 1; I <5; I ++)
{
If (A [I]> MAX)
Max = A [I];
}
Printf ("% 2D", max );
Return 0;
}

**************************

# Include <iostream>
Using namespace STD;
Int main ()
{
Int A = 5;
Int I, n , T;
For (I = 0; I <5; I ++)
Cin> N [I];
Cout <Endl;
While (--)
{

For (I = 0; I <A; I ++)
{
If (N [I]> N [I + 1])
{T = N [I]; n [I] = N [I + 1]; n [I + 1] = T ;}
}
}
Cout <n  <"" <n  <Endl;
Return 0;
}

**********************************

# Include <stdio. h>
Int main ()
{
Int I, j, t, a ;
Printf ("Enter five numbers smaller than 10 thousand :");
For (I = 0; I <5; I ++)
Scanf ("% d", & A [I]);
For (j = 0; j <4; j ++)
For (I = 0; I <4-j; I ++)
If (A [I] <A [I + 1])
{T = A [I + 1];
A [I + 1] = A [I];
A [I] = T;
}
Printf ("% d", a );
Printf ("");
Printf ("% d \ n", a );
Return 0;
}

**************************************** ********************

# Include <stdio. h>
Int main ()
{
Int Max, Min, A, I;
Scanf ("% d", & );
Max = min =;
For (I = 1; I <5; I ++)
{Scanf ("% d", & );
Max = (A> Max? A: Max );
Min = (a <min? A: min );
}
Printf ("% d", Min, max );
Return 0;
}

***********************************

# Include <iostream>
# Include <algorithm>
Using namespace STD;
Int main ()
{
Int A ;
Cin> A > A > A > A > A ;
Cout <* min_element (A, A + 5) <"" <* max_element (A, A + 5) <Endl;
Return 0;
}

*******************************

# Include <iostream>
# Include <algorithm>
Using namespace STD;

Int main ()
{
Int arr ;
For (INT I = 0; I <5; I ++)
{
Cin> arr [I];
}
Sort (ARR, arr + 5 );
Cout <arr  <"" <arr  <Endl;
Return 0;
}

Related Keywords:

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

## A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• #### Sales Support

1 on 1 presale consultation

• #### After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.