Skip to content

Instantly share code, notes, and snippets.

View mikl745's full-sized avatar

Mikhail Goncharov mikl745

View GitHub Profile
# n, k =
n = int(input())
k = int(input())
# n = map(int,input(). split())
# k = map(int,input(). split())
# l = k - 2
# i = n - 1
# s = pow(n, l)
# x = pow(i, 2)
# print(x * s)
w = int(input())
a = [list(map(int, input().split())) for x in range(w)]
y = 0
j = []
for i in range(w):
if i + 1 == w:
if a[i - 1] == a[i]:
y = y + 1
a.append(y)
else:
w = int(input())
a = [list(map(int, input().split())) for x in range(w)]
y = 0
j = []
for i in range(w):
if i == 0:
y = 1
else:
if a[i-1]==a[i]:
y=y+1
@mikl745
mikl745 / treees.py
Created April 4, 2017 20:09
версия 1
w = int(input())
a = [list(map(int, input().split())) for x in range(w)]
y = 0
maxCount = 1
maxHeight = a[0]
currentCount = 1
currentHeight = a[0]
for i in range(1,w):
height = a[i]
n = list(input().split())
o = []
for i in range(len(n)):
tutu = str(n[i])
o.append(len(tutu))
r = o[0] + o[1]
for t in range(1,len(o)):
if r >= o[t] + o[t - 1]:
r = o[t] + o[t - 1]
if n[t] == ".":
i = input()
stroka = i[0:-1].split()
o = []
for i in range(len(stroka)):
tutu = str(stroka[i])
o.append(len(tutu))
r = o[0] + o[1]
for t in range(1,len(o)):
if r >= o[t] + o[t - 1]:
r = o[t] + o[t - 1]
w = int(input())
a = [int( input()) for x in range(w)]
y = []
for i in range(1,min(a)+1):
q = 0
for u in range(len(a)):
if a[u] % i == 0:
q = q + 1
if q == len(a):
y.append(i)
w = int(input())
a = [int( input()) for x in range(w)]
y = []
w = []
def poi(nn):
po = nn[0]
inv_liters = {v: k for k, v in w.items()}
return inv_liters.get(po)
for i in range(1,(min(a))+1):
q = 0
w = int(input())
a = [int( input()) for x in range(w)]
y = []
w = []
def delit(n):
for i in range(1,n+1):
if n % i == 0:
w.append(i)
return w
i = int(input())
a = [int( input()) for x in range(i)]
y = []
w = []
def delit(n):
for i in range(1,n+1):
if n % i == 0:
w.append(i)
return w
for y in range(i):