fork download
copy 
  1. #include <iostream>
  2. #include <cmath>
  3. using namespace std;
  4.  
  5. int main() 
  6. {
  7.     char tb[]={'r','r','p','q','p','p','p','q','q','r','r'};
  8.     const size_t count=sizeof(tb);
  9.     unsigned long sum=0;
  10.     for(size_t i=0;i<count;++i) sum+=tb[i];
  11.     size_t imax=0,imin=0;
  12.     for(size_t i=0;i<count;++i)
  13.     {
  14.     	if(labs(sum-count*tb[imax])<labs(sum-count*tb[i])) imax=i;
  15.     	if(labs(sum-count*tb[imin])>labs(sum-count*tb[i])) imin=i;
  16.     }
  17.     cout<<"nearest: ";
  18.     for(size_t i=0;i<count;++i) if(labs(sum-count*tb[imin])==labs(sum-count*tb[i])) cout<<tb[i];
  19.     cout<<endl;
  20.     cout<<"farest: ";
  21.     for(size_t i=0;i<count;++i) if(labs(sum-count*tb[imax])==labs(sum-count*tb[i])) cout<<tb[i];
  22.     cout<<endl;
  23. 	return 0;
  24. }
Success #stdin #stdout 0s 4264KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
nearest: qqq
farest: rrpppprr
https://ideone.com/EcwtKE
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!