Ферро магнитная лента использовалась как носитель для ЭВМ первого и второго поколения. Еѐ объем был 500 Кб. Какому двоичному числу он соответствует A) 111101002 B) 1001101002 C) 1111111002 D) 1111101002 E) 1111101102
Const LIM=2; W=8; D=2; n=5; m=5; { n строк, m столбцов } var a: array [1..n,1..m] of real; p: real; h: boolean; i, j: integer; begin Randomize; WriteLn('A='); for i:=1 to n do begin for j:=1 to m do begin a[i,j]:=LIM*Random; Write(a[i,j]:W:D); end; WriteLn; end; WriteLn('B='); for i:=1 to n do begin p:=1; h:=false; for j:=1 to m do if (abs(a[i,j])>=1) and (abs(a[i,j])<=1.5) then begin p:=p*sqr(a[i,j]); h:=true; end; if h then Write(p:W:D) else Write('?':W); end; WriteLn; Write('Нажмите ENTER...'); ReadLn; end.
#include <iostream> using namespace std; int minSumRow1(int ** const a, const int N, const int M) { int sum = 0; int *buff = new int[N]; for (size_t i = 0; i < N; ++i) { buff[i] = 0; for (size_t j = 0; j < M; ++j) buff[i] += a[i][j]; } sum = buff[0]; for (size_t i = 1; i < N; ++i) if (sum > buff[i]) sum = buff[i]; return sum; } int minSumRow2(int ** const a, const int N, const int M) { int sum, buff; bool flag = true; for (size_t i = 0; i < N; ++i) { buff = 0; for (size_t j = 0; j < M; ++j) buff += a[i][j]; if (flag || buff < sum) { flag = false; sum = buff; } } return sum; } int maxSumCol1(int ** const a, const int N, const int M) { int sum = 0; int *buff = new int[M]; for (size_t j = 0; j < M; ++j) { buff[j] = 0; for (size_t i = 0; i < N; ++i) buff[j] += a[i][j]; } sum = buff[0]; for (size_t j = 1; j < M; ++j) if (sum < buff[j]) sum = buff[j]; return sum; } int maxSumCol2(int ** const a, const int N, const int M) { int sum, buff; bool flag = true; for (size_t j = 0; j < M; ++j) { buff = 0; for (size_t i = 0; i < N; ++i) buff += a[i][j]; if (flag || buff > sum) { flag = false; sum = buff; } } return sum; } int main() { setlocale(LC_ALL, "Russian"); const size_t N = 5, M = 6; int **a = new int*[N]; cout << "Массив" << endl; for (size_t i = 0; i < N; ++i){ a[i] = new int[M]; for (size_t j = 0; j < M; ++j){ a[i][j] = 1 + rand() % 9; cout << a[i][j] << " "; } cout << endl; } cout << endl;
cout << minSumRow1(a, N, M) << endl; cout << minSumRow2(a, N, M) << endl;
cout << maxSumCol1(a, N, M) << endl; cout << maxSumCol2(a, N, M) << endl; system("pause"); return 0; }
D)
Объяснение: