week02 Тин Павел

Programme1

@@ -0,0 +1 @@
+

hello.py

@@ -0,0 +1 @@
+print('hello, world')

week02/Py1.py

@@ -0,0 +1,5 @@
+def print_hours_minutes(n):
+    print(n//60%24,n%60)
+
+n=int(input())
+print_hours_minutes(n)

week02/Py2.py

@@ -0,0 +1,10 @@
+def print_string(t,n):
+    a=[]
+    a.append('Hello')
+    for i in range(n):
+        a.append(t)
+    print(', '.join([a[i] for i in range(n+1)]))
+
+text=input()
+n=int(input())
+print_string(text,n)

week02/Py3.py

@@ -0,0 +1,11 @@
+def find_min(a,b,c):
+    min =a
+    if b<min:
+        min=b
+    if c<min:
+        min=c
+    print(min)
+a=int(input())
+b=int(input())
+c=int(input())
+find_min(a,b,c)

week02/Py4.py

@@ -0,0 +1,8 @@
+def point(v,t):
+    if v>0:
+        print(v*t%109)
+    else:
+        print((109+v*t)%109)
+v=int(input())
+t=int(input())
+point(v,t)

week02/Py5.py

@@ -0,0 +1,10 @@
+def sum_factorials(n):
+    a=1
+    sum=0
+    for i in range(1,n+1):
+        a=a*i
+        sum+=a
+    print(sum)
+
+n=int(input())
+sum_factorials(n)

week02/Py6.py

@@ -0,0 +1,17 @@
+def find_2nd_max(arr):
+    max=arr[0]
+    for i in range(1,len(arr)):
+        if arr[i]>max:
+            max=arr[i]
+    max2=0
+    for i in range(len(arr)):
+        if ((arr[i]>max2) and (arr[i]<max)):
+            max2=arr[i]
+    print(max2)
+
+mas=[]
+a=int(input())
+while a!=0:
+    mas.append(a)
+    a=int(input())
+find_2nd_max(mas)

week02/Py7.py

@@ -0,0 +1,6 @@
+def even_index(a):
+    evenindex=a[::2]
+    print(' '.join([str(elem) for elem in evenindex]))
+
+a=input().split()
+even_index(a)

week02/Py8.py

@@ -0,0 +1,7 @@
+def even_elems(lst):
+    for elem in lst:
+        if int(elem) %2==0:
+            print(elem,end=' ')
+
+arr=input().split()
+even_elems(arr)

week02/Py9.py

@@ -0,0 +1,10 @@
+from math import sqrt
+
+def length(a,b,c,d):
+    print(sqrt((a-c)**2+(b-d)**2))
+
+x1=float(input())
+y1=float(input())
+x2=float(input())
+y2=float(input())
+length(x1,y1,x2,y2)