Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Language C++ Description: Design and write a program that processes 25 integer v

ID: 3875674 • Letter: L

Question

 Language C++  Description: Design and write a program that processes 25 integer values               (integers) as follows.              --> count all input values (ALL)             --> count values, excluding immediate duplicates (NODUP)                Note: 1 2 2 3 4 2; excluding duplcates: 1 2 3 4 2             --> Compute statistics on ALL and NODUP:                  ALL: sum, average (2 decimal places), min, max                NODUP: sum, average (3 decimal places), max, min   Required Input/Output Formats:       Input Prompt: Enter 25 integer values:       Output labels/format:           ALL COUNT   = xxx           NODUP COUNT = xxx            ALL STATS: SUM = x AVG = x.xx MIN = x MAX = x         NODUP STATS: x:SUM  x.xxx:AVG   x:MAX   x:MIN        Example:  1 2 3 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5                  all count = 25 / nodup count = 5                ...    NOTE: In the formatting a single 'x' means "no field width required', but       '.xx' means 2 decimal places, '.xxx' means 3.  

Explanation / Answer

#include<iostream>
using namespace std;
int main()
{
cout<<" enter 25 numbers";
int ALL_arr[25];
int NODUP_arr[25];
int j=1,i;
int all_count,nodup_count;
int all_sum=0,all_max=0,all_min=0;
int nodup_sum=0,nodup_max=0,nodup_min=0;
float all_avg,nodup_avg;
for(i=0;i<25;i++)
{
cin>>ALL_arr[i];
all_sum=all_sum+ALL_arr[i];
if(i==0){
NODUP_arr[i]=ALL_arr[i];
nodup_sum=nodup_sum+NODUP_arr[i];
}
else
{ if(ALL_arr[i]!=NODUP_arr[j-1])
{
NODUP_arr[j]=ALL_arr[i];
nodup_sum=nodup_sum+NODUP_arr[j];
j++;
}
}

}
all_count=i;
nodup_count=j;
all_avg=(float)all_sum/all_count;
nodup_avg=(float)nodup_sum/nodup_count;

for(int i =0;i<all_count;i++)// MAX FOR all_arr
{
if(all_max<ALL_arr[i])
all_max=ALL_arr[i];
}
for(int i =0;i<nodup_count;i++)// MAX FOR all_arr
{
if(nodup_max<ALL_arr[i])
nodup_max=ALL_arr[i];
}
all_min=ALL_arr[0];
for(int i=0;i<all_count;i++)
{
if(all_min>ALL_arr[i])
all_min=ALL_arr[i];
}
  
nodup_min=NODUP_arr[0];
for(int i=0;i<all_count;i++)
{
if(nodup_min>ALL_arr[i])
nodup_min=ALL_arr[i];
}
cout<<"ALL COUNT : "<<all_count<<endl;
cout<<"NODUP COUNT : "<<nodup_count<<endl;
cout<<"ALL STATS: SUM ="<<all_sum;
printf(" AVG= %.2f. MIN =%d MAX=%d ", all_avg,all_min,all_max);
cout<<"NODUP STATS: %d:SUM"<<nodup_sum;
printf(" %0.3f:AVG %d: MIN %d: MAX ", nodup_avg,nodup_min,nodup_max);

return 0;
}