Ms dos qbasic 1.0: cls randomize timer input "k = ", k input "l = ", l dim x! (k, l) for i = 1 to k for j = 1 to l x(i, j) = rnd * 21 - 10 print using "###"; x(i, j); print ; " "; next j print next i for i = 1 to l * 4 - 1 print ; "_"; next i print for n = 1 to l for i = 1 to l - n - 1 if x(i, 2) < x(i + 1, 2) then b = x(i, 2) x(i, 2) = x(i + 1, 2) x(i + 1, 2) = b end if next i next n for i = 1 to k for j = 1 to l print using "###"; x(i, j); print " "; next j print next i end
Var a:array of array of integer; c:array of array of integer; ma:array of array of integer; i,j,n:integer; begin; randomize; readln(n); setlength(a,n+1); //задаём размерность динамических массивов setlength(c,n+1); setlength(ma,n+1); for i:=1 to n do begin; setlength(a[i],n+1); setlength(c[i],n+1); setlength(ma[i],n+1); end;
writeln('Matrix A:'); //генерируем массив псеводслучайных чисел for i:=1 to n do begin; writeln; for j:=1 to n do begin; a[i,j]:=random(10); write(a[i,j]:4); end; end; writeln;
writeln('Matrix C:'); //аналогично for i:=1 to n do begin; writeln; for j:=1 to n do begin; c[i,j]:=random(10); write(c[i,j]:4); end; end;
for i:=1 to n do //сохраняем матрицу C для транспонации for j:=1 to n do ma[i,j]:=c[i,j]; writeln;
writeln('Transpose matrix C:'); //транспонируем C for i:=1 to n do begin; writeln; for j:=1 to n do begin; c[i,j]:=ma[j,i]; write(c[i,j]:4); end; end;
writeln; writeln('Final matrix:'); // получаем финальную матрицу for i:=1 to n do begin; writeln; for j:=1 to n do begin; ma[i,j]:=2*c[i,j]*a[i,j]; {по свойству дистрибутивности матриц С(A+A)=C*A+C*A=2*C*A} write(ma[i,j]:4); end; end; end.
#include <stdio.h>
int main(){
setlocale(LC_ALL,"");
int a,b;
std::cout << "input a:"; std::cin >> a; std::cout << "\n";
std::cout << "input b:"; std::cin >> b; std::cout << "\n";
std::cout << a * b;
system("pause");
return 0;
}