From 173e6c3cff5305f55c3760cc424fb5f63a22fc1b Mon Sep 17 00:00:00 2001 From: MachulinaDV Date: Mon, 10 Apr 2023 14:32:18 +0300 Subject: [PATCH] =?UTF-8?q?build:=20=D0=B8=D1=81=D1=85=D0=BE=D0=B4=D0=BD?= =?UTF-8?q?=D1=8B=D0=B5=20=D1=84=D0=B0=D0=B9=D0=BB=D1=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- 1M.cbp | 40 +++++++++++++++++++++++++++ main.cpp | 84 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 124 insertions(+) create mode 100644 1M.cbp create mode 100644 main.cpp diff --git a/1M.cbp b/1M.cbp new file mode 100644 index 0000000..2a6af57 --- /dev/null +++ b/1M.cbp @@ -0,0 +1,40 @@ + + + + + + diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..f2ac5b1 --- /dev/null +++ b/main.cpp @@ -0,0 +1,84 @@ +#include +#include +#include + + +using namespace std; + +int main() +{ + size_t n, bin, height; + string str = "*"; + double max, min, step, a; + int i, j; + + cerr<<"Marks: "; + cin>>n; + + vectorA(n); + + + for (i=0; i>bin; + + vectorB(bin); + + max = 0; + min = 10; + + for (i=0; imax) + max = A[i]; + if (A[i]=(min+j*step))&&(A[i]<(min+(j+1)*step))) + { + B[j]++; + break; + } + } + } + + for (i=0; i