Const n = 10; var a: array[1..n] of integer; i, j, t: integer; flag:boolean;
begin Randomize; Writeln('Исходный массив'); for i := 1 to n do begin a[i] := random(101)-50; Write(a[i]:4) end; Writeln; i:=1; repeat flag:=true; for j := 1 to n-i do if a[j] > a[j+1] then begin t := a[j]; a[j] := a[j+1]; a[j+1] := t; flag:=false end; Inc(i); until (i>n-1) or flag; Writeln('Отсортированный по возрастанию массив'); for i := 1 to n do Write(a[i]:4); Writeln end.
Python
import math
def C(A, B, c):
#C^2 = A^2 + B^2 - 2*A*B * cos(c)
C = math.sqrt(((A ** 2) + (B ** 2) - 2 * A * B * math.cos(c)))
return C
def b(A, C, B):
#cos(b) = (A^2 + C^2 - B^2) / (2*A*C)
b = (A ** 2 + B ** 2 + C ** 2) / 2 * A * C
return b
def a(b, c):
#a = 360 - b - c
a = 360 - b - c
return a
def S(A, B, a):
#S = A * B * sin(a)
S = A * B * math.sin(a)
return S
def P(A, B, C):
#P = A + B + C
P = A + B + C
return P
A, B, c = int(input()), int(input()), int(input())
C = C(A, B, c)
b = b(A, C, B)
a = a(b, c)
S = S(A, B, a)
P = P(A, B, C)
print('C: ', C)
print('b: ', b)
print('a: ', a)
print('S: ', S)
print('P: ', P)