<span>program delehka(input,output);
var
a:Array[1..1000010] of longint;
i,n,s,ma,mi,sl:longint;
begin
assign(input,'input.txt');
reset(input);
assign(output,'output.txt');
rewrite(output);
readln(n);
mi:=(1 shl 30);
ma:=-(1 shl 30);
for i:=1 to n do
begin
read(a[i]);
ma:=max(ma,a[i]);
mi:=min(mi,a[i]);
end;
if ma=mi then write(0,'',n,'',0)
else
begin
for i:=1 to n do
begin
if a[i]=ma then s:=s+1;
if a[i]=mi then sl:=sl+1;
end;
writeln(s,' ',sl,' ',n-s-sl);
close(input);
close(output);
end;
end.</span>
program z1;
uses crt;
var n,m,i:integer;
begin
repeat
writeln('Введите числа');
readln(n,m);
until n<m;
for i:=n to m do
begin
if i mod 2 =0 then write(i:4);
end;
end.
#include <iostream>
int count_dividers(int a) {
int res = 1;
for (int i = 2; i <= a; i++) {
if (a % i == 0) {
res++;
}
}
return res;
}
int main(void) {
int a, b;
std::cin >> a >> b;
for (int i = a; i <= b; i++) {
std::cout << count_dividers(i) << " ";
}
std::cout << std::endl;
return 0;
}
Могу только это решение дать
var x,y:real;
begin
read(x,y);
if (x*x+y*y>4) and (y0) then writeln ('YES')
else writeln('NO');
end.