Program nnatovna;
uses crt;
const n=13;
var
a:array [1..n] of integer;
i,min,max,temp:integer;
begin
writeln('*** alphaues is thinking... ***');
writeln('*** OK ***');
writeln();
randomize;
writeln('Элементы массива:');
{создание и вывод массива}
for i:=1 to n do
begin
a[i]:=random(100)-50;
write (a[i]:5);
end;
{ищем номера мин и мах}
min:=1;
max:=1;
for i:=1 to n do
begin
if a[min]>a[i] then min:=i;
if a[max]<a[i] then max:=i;
end;
{меняем местами мин и мах элементы}
temp:=a[min];
a[min]:=a[max];
a[max]:=temp;
{вывод результата}
writeln();
writeln('Результат:');
for i:=1 to n do
write(a[i]:5);
end.
c = int(input('Enter 2 to start'))
while c != 1:
import math as m
a = int(input('Write a: '))
b = int(input('Write b: '))
c = int(input('Write c: '))
D = (b ** 2) - (4 * a * c)
print ('D =',D)
if D > 0:
print('D > 0')
x = (-b + (m.sqrt(D))) / (2 * a)
x1 = (-b - (m.sqrt(D))) / (2 * a)
print ('x1 =',x)
print ('x2 =',x1)
elif D == 0:
print('D = 0')
x = -b / (2 * a)
print ('x =',x)
else:
print('D < 0')
print ('No roots')
c = int(input('Enter 1 to quit or 2 to repeat'))