efew - master - klinich/nn

def simple(x):   
return x == 2 or all(x%d for d in range (2,round(x**0.5)+1)) 
for x in '0123456789abcdef'[::-1]:  
z = int('109' + x, 16) + int('12' + x + '7', 16) 
if simple(z): 
print(z, x) 
break 

count = 0
for m in range(1,10500): 
s = m * '134' 
while '13' in s or '84' in s or '81' in s: 
if '13' in s: s = s.replace('13', '8', 1) 
if '84' in s: s = s.replace('84', '48', 1) 
if '81' in s: s = s.replace('81', '1', 1) 
c = sum(map(int, s)) 
if c**0.5 == int(c**0.5): 
count += 1 
if count == 5: 
print(m) 
break 

count = 0 
for s1 in "AЛTO": 
    for s2 in "AЛTO": 
        for s3 in "AЛTO": 
            for s4 in "AЛTO": 
                for s5 in "AЛTO": 
                    s = s1 + s2 + s3 + s4 + s5 
                    if s1 == "A" or s1 == "O": 
                        count += 1 
print(count)

k = 0 
for s1 in "АБВ": 
    for s2 in "АБВЬ": 
        for s3 in "АБВЬ": 
            for s4 in "АБВЬ": 
                s = s1 + s2 + s3 + s4 
                if (len(set(s)) == 4) and ("АЬ" not in s): 
                    k += 1 
print(k)


from ipaddress import * 
net = ip_network('192.138.32.160/255.255.255.240') 
count = 0 
for ip in net:    
# f‘ {ip:b} ‘ – двоичная запись IP-адреса 
if f' {ip:b} '.count('1') % 2 == 0: # чётное число единиц в двоичной записи 
count += 1 
print(count)