main.cpp

@@ -2,88 +2,162 @@
 #include <vector>
 using namespace std;
 
-struct Input
+int main()
-{
-    vector<double> numbers;
-    size_t bin_count;
-};
-Input
-input_data()
 {
-    size_t number_count;
+    const size_t SCREEN_WIDTH = 80;
-    cin >> number_count;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
-    Input in;
+    unsigned int n;
-    in.numbers.resize(number_count);
+    size_t m;
-    for (size_t i = 0; i < number_count; i++)
+    int i;
+    char sim;
+    float lo,hi,dif, maxxs,minxs;
+    cerr<< "enter amount of numbers";
+    cin>>n;
+    vector <float> xs(n);
+    cerr<<"let's introduse array";
+    for(i=0; i < n; i++)
     {
-        cin >> in.numbers[i];
+        cin>> xs[i];
     }
-    size_t bin_count;
+    cerr << "enter amount of intervals";
-    cin >> bin_count;
+    cin >> m;
-    return in;
+    vector <size_t> b(m);
-}
+    maxxs = minxs = xs[0];
-
+    for (i=0; i < n; i++)
-void
-find_minmax(const vector<double>& numbers, double& min, double& max)
-{
-    min = numbers[0];
-    max = numbers[0];
-    for ( size_t i=0; i < numbers.size(); i++)
     {
-        if (numbers[i] > max) max=numbers[i];
+        if (xs[i] > maxxs) maxxs=xs[i];
-        if (numbers[i] < min) min=numbers[i];
+        if (xs[i] < minxs) minxs=xs[i];
     }
-};
+    dif=(maxxs - minxs)/m;
-
+    for(int i=0; i < n; i++)
-std::vector<long long unsigned int>
-make_histogram(const vector<double>& numbers,size_t bin_count)
-{
-    float lo,hi,dif;
-    double min, max;
-    find_minmax(numbers, min, max);
-    vector <size_t> bins(bin_count) ;
-    dif=(max - min)/bin_count;
-    for(int i=0; i < numbers.size(); i++)
     {
         bool found = false;
-        for (int j=0; (j < bin_count-1)&&!found; j++)
+        for (int j=0; (j < m-1)&&!found; j++)
         {
-            lo= min + j*dif;
+            lo= minxs + j*dif;
-            hi= min + (j+1)*dif;
+            hi= minxs + (j+1)*dif;
-            if ((lo <= numbers[i]) && (numbers[i] <hi ))
+            if ((lo <= xs[i]) && (xs[i] <hi ))
             {
-                bins[j]++;
+                b[j]++;
                 found = true;
             }
         }
         if (!found)
         {
-            bins[bin_count - 1]++;
+            b[m - 1]++;
         }
     }
-    return bins;
+    size_t bmax,height,hem,hep;
-}
+    int ibmax;
-void show_histogram_text(vector <size_t> &bins)
+    bmax=b[0];
-{
+    for (i=0; i < m; i++)
-    for (size_t i=0; i<bins.size(); i++)
     {
-        if (bins[i]!=0)
+        if (b[i] > bmax) bmax=b[i];
+        ibmax = i;
+    }
+    //cout<<bmax<<endl;
+    if (bmax > MAX_ASTERISK)
+    {
+        for(int j=0; j < m; j++)
         {
-            cout<<bins[i]<<" | "  ;
+            if (b[j]<100)
-            for (size_t j=0; j<bins[i]; j++)
+            {
+                cout<<" ";
+            }
+            if (b[j]<10)
             {
-                cout<<"*";
+                cout<<" ";
+            }
+
+            height = 76 * ( static_cast<double>(b[j]) / bmax);
+            hem = 76 * ( static_cast<double>(b[j-1]) / bmax);
+            hep = 76 * ( static_cast<double>(b[j+1]) / bmax);
+            cout<<b[j]<<'|';
+
+            if (j==0)
+            {
+                for (int u=0; u < height; u++)
+                {
+                    if ((b[0] > b[1])&&(u == hep - 1)) cout<<'v';
+                    else cout<<'*';
+                }
+            }
+            else
+            {
+                if (j == m)
+                {
+
+                    for (int u = 0; u < height; u++)
+                    {
+                        if ((b[m] > b[m-1])&&(u == hem-1)) cout<<'^';
+                        else cout<<'*';
+                    }
+                }
+                else
+                {
+                    for (int u=0; u < height; u++)
+                    {
+                        sim='*';
+                        if ((b[j] > b[j-1]) && (u == hem)) sim='^';
+                        if ((b[j] > b[j+1])&&(u == hep)&&(u != height)&&(u != 0)) sim='V';
+                        if ((b[j-1] == b[j+1])&&(u == hep)) sim='N';
+                        cout<<sim;
+                    }
+
+                }
             }
             cout<<endl;
         }
     }
-}
+    for(int j=0; j < m; j++)
-int main()
+        {
-{
+            if (b[j]<100)
-    auto in = input_data();
+            {
-    auto bins = make_histogram(in.numbers, in.bin_count);
+                cout<<" ";
-    show_histogram_text(bins);
+            }
+            if (b[j]<10)
+            {
+                cout<<" ";
+            }
+
+            height = 76 * ( static_cast<double>(b[j]) / bmax);
+            hem = 76 * ( static_cast<double>(b[j-1]) / bmax);
+            hep = 76 * ( static_cast<double>(b[j+1]) / bmax);
+            cout<<b[j]<<'|';
 
+            if (j==0)
+            {
+                for (int u=0; u < b[i]; u++)
+                {
+                    if ((b[0] > b[1])&&(u == b[i+1] - 1)) cout<<'v';
+                    else cout<<'*';
+                }
+            }
+            else
+            {
+                if (j == m)
+                {
 
+                    for (int u = 0; u < b[i]; u++)
+                    {
+                        if ((b[m] > b[m-1])&&(u == b[i-1]-1)) cout<<'^';
+                        else cout<<'*';
+                    }
+                }
+                else
+                {
+                    for (int u=0; u < b[i]; u++)
+                    {
+                        sim='*';
+                        if ((b[j] > b[j-1]) && (u == b[i-1])) sim='^';
+                        if ((b[j] > b[j+1])&&(u == b[i+1])&&(u != b[i])&&(u != 0)) sim='V';
+                        if ((b[j-1] == b[j+1])&&(u == b[i+1])) sim='N';
+                        cout<<sim;
+                    }
+
+                }
+            }
+            cout<<endl;
+        }
     return 0;
 }