Задание 17 ЕГЭ информатика по теме «Обработка целочисленной информации»

var
 var k, n, min:integer;
 
begin
  k:=0; min:=8433;
  for n:= 3712 to 8432 do
    if (n mod 2 = n mod 4) and ((n mod 13=0) or (n mod 14=0) or (n mod 15=0)) then
      begin
        if min>n then
        min:=n;
        k:=k+1;
      end;
      Writeln (k,' ',min);
End.

begin
  var l := new List<integer>;
  for var n := 3712 to 8432 do
    if (n mod 2 = n mod 4) and ((n.divs(13)) or (n.divs(14)) or (n.divs(15))) then
    begin
      l.add(n)
    end;
  print(l.Count, l.Min)
end.

begin
 var s := Range( 3712, 8432)
   .Where(i -> ((i mod 13=0) or (i mod 14=0) or (i mod 15=0)) and (i mod 2 = i mod 4));
    // или: .Where( i -> (i.DivsAny(13,14,15)) and (i mod 2 = i mod 4));
 s.Count.Print;
 s.Min.Print;  
end.

L = [x for x in range(3712, 8432+1) if (x % 13 == 0 or x % 14 == 0 or x % 15 == 0) and ( x % 2 == x % 4)]
print(len(L),' ',L[0])

#include <iostream>
int main()
{
	int count = 0;
	int min = 8433;
	for (int n = 3712; n <= 8432; n++)
		if (((n % 2 == n % 4) && ((n % 13 == 0) || (n % 14 == 0) || (n % 15 == 0))) )
		{
			if (n < min) min = n;
			count += 1;
		}
	std::cout << count << " " << min;
}

uses school;
begin
  var l := new List<integer>;
  for var n := 1000 to 9999 do
  begin
    var str := n.ToString.ToBase(5);
    if (str.Length = 6) and (str[str.length - 1] = '2')
       and ((str[str.length] = '1') or (str[str.length] = '3')) then
      l.add(n)
  end;
  print(l.Count, l.Min)
end.

### uses school;
var s := Range(1000, 9999)
   .Where(i -> (i.ToString.ToBase(5).Length=6) and (i div 5 mod 5 = 2)
       and((i mod 5 = 1) or (i mod 5 = 3)));
s.Count.Print;
s.Min.Print;

numb=''
result=list()
for i in range(1000, 9999+1):
    if ((i // 5) % 5 ==2) and (( i % 5 == 1) or ( i % 5 == 3)):
        while i>=5: #Цикл перевода числа из 10-й в 5-ю сс
            s=i%5
            numb=str(s)+numb
            i=i//5
            if i<5:
                numb=str(i)+numb
        n=len(numb)
        if n>5:
            result.append(numb) # список из чисел в 5-й с.с
        numb=""
kolvo=len(result)
minNumb=int(min(result),5) # перевод в десятичную с.с и поиск min
print(kolvo,minNumb)

begin
  var l := new List<integer>;
  for var n := 2495 to 7083 do
    if ((n mod 16 = 10) or (n mod 16 = 15)) and (n div 16 mod 16 = 1) and (n mod 5 <> 0) and (n mod 9 <> 0) then begin
      l.Add(n);
    end;
  print(l.Count,l.Min)
end.

### uses school;
var s := Range(2495, 7083)
   .Where( i -> ((i mod 16 = 10)or(i mod 16 =15))and(i div 16 mod 16 =1)and(i mod 5 <> 0)and(i mod 9 <> 0));
s.Count.Print;
s.Min.Print;

L = [x for x in range(2495, 7083+1) 
     if (x % 5 != 0 and x % 9 != 0 and x // 16 % 16 == 1 and (x % 16 == 10 or x % 16 == 15))]
print(len(L),' ',L[0])

##
var l := new List<integer>;
for var n := 8800 to 55535 do
begin
  var p := 1;
  var f7 := false;
  var numb := n;
  while numb > 0 do
  begin
    var dig := numb mod 10;
    if dig = 7 then f7 := true;
    p *= dig;
    numb := numb div 10;
  end;
  if (f7) and (p > 35) then l.add(n)
end;
print(l.Max, l.count);

##
uses school;
var s:=(8800..55535)
   .Where(i -> (i.Digits.Product > 35) and (7 in i.Digits));
Println(s.max, s.Count )

count = 0
m = 0
for i in range(8800, 55535+1):
    x = i
    p = 1
    while x>0:
        p*=x % 10
        x//=10
    if p>35 and p % 7 == 0:
        count+=1
        m=i
print(m, count)

##
var l := new List<integer>;
for var i := 12356 to 76435 do
begin
  var n := 0;
  for var j:=1 to i do
  begin
    if i.Divs(j) then n+=1;
  end;
  if n > 15 then l.Add(i);
end;
print(l.Count, l.max)

##
uses school;
var s:=(12356..76435)
  .Where(i ->i.Divisors.Count>15);
Print(s.Count, s.Max);

start, end = 12356, 76435
def valid( x ):
  count = 2
  q = round(x**0.5)
  if q*q == x:
    count += 1
    q -= 1
  for i in range(2, q+1):
    if x % i == 0:
      count += 2
  return count > 15
count = 0
ma = 0
for x in range(start, end+1):
  if valid(x):
    count += 1
    ma = x
print( count, ma )

##
var a := ReadLines('17-2.txt').Select(t -> t.ToInteger).ToArray;
var m := integer.MinValue;
var count := 0;
var pos := 0;
for var i:=0 to a.Length-1 do
begin
  if a[i] > m then 
    begin
      m := a[i];
      pos := i;
      count := 0
    end;
  if a[i] = m then count += 1;
end;
print(count, pos)

##
var a := ReadLines('17-2.txt').Select(t -> t.ToInteger).ToArray;
var m := a.Max;
print(a.CountOf(m), a.IndexMax + 1)

with open('17-2.txt') as f:
    a = [int(x) for x in f.readlines()]
 
max_el = max(a)
print(a.count(max_el), a.index(max_el) + 1)

var a := ReadLines('17-1.txt').Select(t -> t.ToInteger).ToArray;
var pair_count := 0;
var minS := 20000;
for var i := 0 to a.High - 1 do
  if (a[i] mod 7 = 0) and (a[i + 1] mod 17 <> 0)
      or (a[i + 1] mod 7 = 0) and (a[i] mod 17 <> 0) then
  begin
    pair_count += 1;
    minS := min(minS, a[i] + a[i + 1])    
  end;
println(pair_count, minS)

##
var data := ReadLines('17-1.txt').Select(x -> x.ToInteger); // работаем с последовательностью
var pairs := data.NWise(2)
 .Where(\(a,b)->(a.Divs(7) and (not b.Divs(17)) 
    or ((b.Divs(7) and (not a.Divs(17))))));
pairs.Count.Print;  
var sums:=pairs.Select(\(a,b)->a+b);  
sums.min.print;

count = 0
min_s = 20000
with open('17-1.txt') as f:
    a = int(f.readline())
    for line in f.readlines():
        b = int(line)
        if (a % 7 == 0 and b % 17 != 0
            or b % 7 == 0 and a % 17 != 0):
            count += 1
            min_s = min(min_s, a + b)
        a = b
print(count, min_s)