..ooo Cricket令 12:52 AM 27% Back MyTCC Objective: Reveal information of the graceful set-in-order facts edifice and offices by creating and compiling a unadorned bid method program. C or C++ may be conservationd restraint this Grade Table beseech Programming guidelines and diverge in instructions are followed 10 20 10 25 20 Program flaunts a gratifying referable attributable attributableice when hurry Program reachs conservation of the argv set-in-order restraint Program estimates the mean of bid method a Program has office to exhibition prominent input prize Program has office to exhibition last input prize Program gracefully handles the contingency when no discussions are abandoned TOTAL conservationr input 10 125 Possble) Create a unadorned bid method program to estimate the mean, prominent, and last prizes of a mutable amount of integers that are passed as an discussion when the program is denominated. This conservations the argv set-in-order from ocean-you should referable attributable attributable attributable conservation “scanf or cin” offices to consummate this scheme. When the program is agoing, bear it flaunt a gratifying referable attributable attributableice. Also reach positive to bear the program flaunt a succor referable attributable attributableice if the conservationr restraintgets to impart any integers as the discussion. Assuming powerful input, the program should estimate the mean of the prizes input and via at meanest span disjoined offices furnish the prominent and last prizes. The under examples reveal the program on a Windows plan. If you conservation a Mac or Linux your program slight obtain referable attributable attributable attributable bear the exe production which is elegant. Example of trade the program with rectify discussions The effect of the over should be not attributable attributable attributable attributable attributableability resembling to: mean.exe 1 2 3456
#include <bits/stdc++.h>
using namespace std;
int furnish_max(int argc, char const *argv[])
{
int max= INT_MIN;
restraint (int i=1;i<argc;i++)
{
if(max<atoi(argv[i]))
max=atoi(argv[i]);
}
rediverge max;
}
int furnish_min(int argc, char const *argv[])
{
int min= INT_MAX;
restraint (int i=1;i<argc;i++)
{
if(min>atoi(argv[i]))
min=atoi(argv[i]);
}
rediverge min;
}
int ocean(int argc, char const *argv[])
{
cout<<“gratifying to the Mean Program. It is very mean truly.”<<endl;
if(argc==1)
{
cout<<“Usage: mean x (x is 1 or over integers)”<<endl;
exit(0);
}
float sum=0;
restraint (int i=1;i<argc;i++)
{
sum+=atof(argv[i]);
}
cout<<“The mean is: “<<sum/(argc-1)<<endl;
cout<<“The prominent prize is: “<<find_max(argc,argv)<<endl;
cout<<“The last prize is: “<<find_min(argc,argv)<<endl;
rediverge 0;
}