Program prim; var n,s1,s2:integer; begin write('n='); readln(n); s1:=n div 1000 + n div 100 mod 10; s2:=n mod 100 div 10+n mod 10; if s1=s2 then writeln(s1,'=',s2) else writeln(s1,'<>',s2) end. Пример работы: n=1345 4<>9
var a: Array[1..10, 1..10] of Real; n, m, i, j, i1, j1, i2, j2: Byte; min, max: Real;
begin Writeln('Введите кол-во строк и столбцов'); Read(n, m);Writeln; for i := 1 To n Do begin Writeln('Введите ', m, ' эл. ', i, '-й строки матрицы'); for j := 1 To m Do Read(a[i, j]) end; Writeln('Ваша матрица:'); for i := 1 To n Do begin for j := 1 To m Do Write(a[i, j]:7:2); Writeln end; for i := 1 To n Do begin min := a[i, 1];i1 := i;j1 := 1; for j := 1 To m Do if a[i, j] < min then begin min := a[i, j];i1 := i;j1 := j end; if i = 1 Then begin max := min;i2 := i1;j2 := j1 end Else if min > max Then begin max := min;i2 := i1;j2 := j1 end end; Writeln('Максимальным из минимумов строк является элемент ', max:6:2, ' с индексами [', i2, ',', j2, ']'); end.
#include <iostream> #include <ctime> #include <stdlib.h> using namespace std;
double Sum(int *A, int N, int C, int M);
int main() { srand(time(0)); int N, C = 19, M = 30; cout << "N = ", cin >> N; int Train[N]; for(int i = 0; i < N; i++) cout << (Train[i] = rand() % (M+1)) << " "; cout << "\nSum = " << Sum(&Train[0], N, C, M);; return 0; }
double Sum(int*A, int N, int C, int M) { double S = 0; int k = 0; for(int i = 0; i < N; i++) { S += A[i]*C; k +=M - A[i]; } cout << "\nk = " << k; return S; }
var n,s1,s2:integer;
begin
write('n='); readln(n);
s1:=n div 1000 + n div 100 mod 10;
s2:=n mod 100 div 10+n mod 10;
if s1=s2 then writeln(s1,'=',s2) else writeln(s1,'<>',s2)
end.
Пример работы:
n=1345
4<>9