Advertisement
Guest User

Untitled

a guest
Jun 27th, 2017
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.10 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. void mnogoSimvolov(int a[],int ma, int m, char simvol){
  5.     int i = 0;
  6.     while(i < m){
  7.     cout << simvol;
  8.     i++;
  9.     }
  10. }
  11.  
  12. int maxx(int a[], int array_size, int Size){
  13.     int i = 0;
  14.     int ma = a[0];
  15.     //int ma = a[0];
  16.     while(i < Size){
  17.         if(ma < a[i]){
  18.             ma = a[i];
  19.         }
  20.         i++;
  21.     }
  22.     return ma;
  23. }
  24.  
  25. void risunoc(int a[],int array_size, int Size){
  26.     maxx(a, array_size, Size);
  27.     int i = 0;
  28.     while(i < Size){
  29.         mnogoSimvolov(a, maxx(a, array_size, Size), (maxx(a, array_size, Size) - a[i]) / 2, ' ');
  30.         mnogoSimvolov(a, maxx(a, array_size, Size), a[i], '*');
  31.         i++;
  32.         cout << endl;
  33.     }
  34.  
  35. }
  36.  
  37. void opros(){
  38.     setlocale(LC_ALL, "Russian");
  39.     int i = 0, b = 1, Size;
  40.     i = 0;
  41.     b = 1;
  42.     int a[100];
  43.     while(i < b){
  44.         cout <<"Число номер " << i+1 << " :";
  45.         cin >> a[i];
  46.         if(a[i] == 0){
  47.             b = i-2;
  48.             Size = i;
  49.         }
  50.     i++;
  51.     b++;
  52.     }
  53.     risunoc(a, 100, Size);
  54. }
  55.  
  56. int main (){
  57.     opros();
  58. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement