├── recursion
    ├── fibonacci.py
    ├── gen_recurse.py
    ├── grasshopper.py
    ├── merge_sort.py
    ├── turtle_koh.py
    └── matroska.py
├── numbers
    ├── one-way.py
    ├── digits.py
    ├── real2016-27.py
    ├── demo2016-27.py
    └── max3_number.py
├── README.md
├── catch_the_ball
    ├── game_canvas.py
    ├── widgets_testing.py
    └── ball.py
├── life_game
    ├── cell_automat.py
    ├── life_game.py
    ├── map1.txt
    └── map2.txt
├── .gitignore
├── x_and_o
    └── x_and_o_ai.py
├── graphs
    ├── count_components.py
    └── input_graph.py
├── massives
    └── sorting.py
├── волновой алгоритм
    └── task.py
├── the_gun
    └── gun.py
└── LICENSE


/recursion/fibonacci.py:
--------------------------------------------------------------------------------
1 | def fib(n):
2 |     if n <= 1:
3 |         return n
4 |     else:
5 |         return fib(n-1) + fib(n-2)
6 |     
7 | 


--------------------------------------------------------------------------------
/recursion/gen_recurse.py:
--------------------------------------------------------------------------------
 1 | def gen(n, prefix = []):
 2 |     if len(prefix) == n:
 3 |         print(*prefix)
 4 |     else:
 5 |         for digit in range(1, n+1):
 6 |             if digit not in prefix:
 7 |                 gen(n, prefix + [digit])
 8 | 
 9 | gen(4)
10 | 


--------------------------------------------------------------------------------
/numbers/one-way.py:
--------------------------------------------------------------------------------
 1 | N = 4
 2 | m1 = None
 3 | for i in range(N):
 4 |     x = int(input())
 5 |     if x%2 == 0:
 6 |         if m1 == None or x > m1:
 7 |             m1 = x
 8 | if m1 != None:
 9 |     print('максимальное чётное', m1)
10 | else:
11 |     print('чётных чисел не было')


--------------------------------------------------------------------------------
/numbers/digits.py:
--------------------------------------------------------------------------------
 1 | x = int(input())
 2 | n = 0
 3 | s = 0
 4 | p = 1
 5 | while x:
 6 |     digit = x%10
 7 |     n += 1
 8 |     s += digit
 9 |     p *= digit
10 | 
11 |     x //= 10
12 | 
13 | print('количество цифр:', n)
14 | print('сумма цифр:', s)
15 | print('произведение цифр:', p)
16 | print('среднее арифметическое:', s/n)
17 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # kpk2016
2 | Репозиторий для сдачи проектов учащимися КПК Фоксфорд 2016 по информатике.
3 | Здесь будет находиться код Т.Ф., а также лучшие дополнения, прошедшие модерацию.
4 | Для собственных изменений просьба сделать себе форк данного репозитория и прислать на почту tkhirianov на сайте foxford.ru запрос: "КПК2016 нужна проверка" с указанием логина на GitHub.
5 | 


--------------------------------------------------------------------------------
/numbers/real2016-27.py:
--------------------------------------------------------------------------------
 1 | N = int(input())
 2 | k = 2
 3 | bad_delta = 20001
 4 | s = 0
 5 | delta_min = bad_delta
 6 | for i in range(N):
 7 |     x, y = [int(word) for word in input().split()]
 8 |     s += min(x, y)
 9 |     if abs(x-y)%k != 0 and abs(x-y) < delta_min:
10 |         delta_min = abs(x-y)
11 | if s%k != 0:
12 |     print(s)
13 | elif delta_min != bad_delta:
14 |     print(s + delta_min)
15 | else:
16 |     print(0)
17 | 


--------------------------------------------------------------------------------
/recursion/grasshopper.py:
--------------------------------------------------------------------------------
 1 | def find_shortest_path(price, n):
 2 |     C = [float('inf'), price[1]] + [0]*(n-1)
 3 |     for i in range(2, n+1):
 4 |         C[i] = price[i] + min(C[i-1], C[i-2])
 5 |     print(*enumerate(C))
 6 | 
 7 |     path = [n]
 8 |     i = n
 9 |     while i != 1:
10 |         if C[i-1] < C[i-2]:
11 |             i = i-1
12 |         else:
13 |             i = i-2
14 |         path.append(i)
15 |     path[:] = path[::-1]
16 |     return path
17 | 
18 | price = [0, 10, 2, 2, 1, 6, 2, 3, 0, 1, 3]
19 | path = find_shortest_path(price, 10)
20 | 


--------------------------------------------------------------------------------
/numbers/demo2016-27.py:
--------------------------------------------------------------------------------
 1 | N = int(input())
 2 | # считываем в очередь первые 6 чисел
 3 | Q = [int(input()) for i in range(6)]
 4 | min_even = 1001
 5 | beta = 1000001
 6 | pos = 0
 7 | for i in range(N-6):
 8 |     # первый элемент покидает очередь - и соревнуется с текущими минимальными
 9 |     x = Q[pos%6]
10 |     min_x = min(min_x, x)
11 |     if x%2 == 0 and x < min_even:
12 |         min_even = x
13 |     x = int(input())
14 |     beta = min(beta, x*min_even)
15 |     if x%2 == 0:
16 |         beta = min(beta, x*min_x)
17 | 
18 |     Q[pos%6] = x
19 |     pos += 1


--------------------------------------------------------------------------------
/numbers/max3_number.py:
--------------------------------------------------------------------------------
 1 | x = int(input())
 2 | m1 = m2 = m3 = -100000
 3 | 
 4 | while x != 0:
 5 |     # обработка x:
 6 |     if x > m1:
 7 |         m1, m2, m3 = x, m1, m2
 8 |         m1_n, m2_n, m3_n = 1, m1_n, m2_n
 9 |     elif x == m1:
10 |         m1_n += 1
11 |     elif x > m2:
12 |         m2, m3 = x, m2
13 |         m2_n, m3_n = 1, m2_n
14 |     elif x == m2:
15 |         m2_n += 1
16 |     elif x > m3:
17 |         m3 = x
18 |         m3_n = 1
19 |     elif x == m3:
20 |         m3_n += 1
21 |     # считывание x для следующей итерации:
22 |     x = int(input())


--------------------------------------------------------------------------------
/recursion/merge_sort.py:
--------------------------------------------------------------------------------
 1 | def merge_sort(A):
 2 |     if len(A) <= 1:
 3 |         return A
 4 |     middle = len(A)//2
 5 |     L = merge_sort(A[:middle])
 6 |     R = merge_sort(A[middle:])
 7 |     return merge(L, R)
 8 | 
 9 | def s(A):
10 |     return A if len(A) <= 1 else merge(s(A[:len(A)//2]),
11 |                                        s(A[len(A)//2:]))
12 | 
13 | def merge(A, B):
14 |     i = 0
15 |     k = 0
16 |     n = 0
17 |     C = [0]*(len(A)+len(B))
18 |     while i < len(A) and k < len(B):
19 |         if A[i] < B[k]:
20 |             C[n] = A[i]
21 |             i += 1
22 |         else:
23 |             C[n] = B[k]
24 |             k += 1
25 |         n += 1
26 |     C[n:] = A[i:] + B[k:]
27 |     return C
28 |     
29 | 


--------------------------------------------------------------------------------
/catch_the_ball/game_canvas.py:
--------------------------------------------------------------------------------
 1 | import tkinter
 2 | 
 3 | 
 4 | def paint(event):
 5 |     """ Обработчик событий для холста canvas
 6 |     :param event: событие
 7 |     :return: ничего
 8 |     """
 9 |     print(event.x, event.y)
10 |     if event.widget != canvas:
11 |         print('Странно, ведь paint() привязывали только к canvas...')
12 |         return
13 |     canvas.coords(line, 0, 0, event.x, event.y)
14 | 
15 | 
16 | root = tkinter.Tk()
17 | 
18 | canvas = tkinter.Canvas(root, background='white', width=400, height=400)
19 | canvas.bind("<Motion>", paint)
20 | canvas.pack()
21 | 
22 | line = canvas.create_line(0, 0, 10, 10)
23 | for i in range(10):
24 |     canvas.create_oval(2+i*40, 2+i*40, i*40+30, i*40+30, width=2, fill='green')
25 | 
26 | root.mainloop()
27 | print("Эта строка будет достигнута только при выходе из приложения.")


--------------------------------------------------------------------------------
/recursion/turtle_koh.py:
--------------------------------------------------------------------------------
 1 | from turtle import *
 2 | 
 3 | 
 4 | def koh_forward(L, n):
 5 |     if n == 0:
 6 |         t.forward(L)
 7 |     else:
 8 |         koh_forward(L/3, n-1)
 9 |         t.left(60)
10 |         koh_forward(L/3, n-1)
11 |         t.right(120)
12 |         koh_forward(L/3, n-1)
13 |         t.left(60)
14 |         koh_forward(L/3, n-1)
15 | 
16 | def demo():
17 |     for n in range(0, 4):
18 |         t.color(colors[n])
19 |         t.penup()
20 |         t.goto(-200, 0)
21 |         t.pendown()
22 |         koh_forward(300, n)
23 | 
24 | def snowflake():
25 |     t.penup()
26 |     t.goto(-150, 100)
27 |     t.color('black', 'cyan')
28 |     t.pendown()
29 |     t.begin_fill()
30 |     for edge in range(3):
31 |         koh_forward(300, 4)
32 |         t.right(120)
33 |     t.end_fill()
34 |     
35 | t = Turtle(shape='turtle')
36 | colors = ['gray', 'green', 'blue', 'orange', 'black', 'magenta', 'cyan']
37 | t.speed(10)
38 | snowflake()
39 | 


--------------------------------------------------------------------------------
/life_game/cell_automat.py:
--------------------------------------------------------------------------------
 1 | # -. coding: utf8 .-
 2 | __author__ = "Timofey Khirianov"
 3 | 
 4 | N = 150
 5 | 
 6 | def cell_calculate(left, current, right):
 7 |     return left^right
 8 | 
 9 | def calculate_field(field):
10 |     """field -- список из N ноликов или единичек"""
11 |     new_field = [0]*N
12 |     for i in range(1, N-1):
13 |         new_field[i] = cell_calculate(field[i-1], field[i], field[i+1])
14 |     field[:] = new_field
15 | 
16 | def generate_field():
17 |     field = [0]*N
18 |     x = N//2
19 |     field[x] = 1
20 |     return field
21 | 
22 | def print_field(field):
23 |     for cell in field:
24 |         print('۞' if cell else ' ' , end = '')
25 |     print()
26 |     
27 | def modelling():
28 |     """ цикл моделирования клеточного автомата """
29 |     field = generate_field()
30 |     print_field(field)
31 |     for t in range(50):
32 |         calculate_field(field)
33 |         print_field(field)
34 | 
35 | if __name__ == '__main__':
36 |     modelling()
37 | 


--------------------------------------------------------------------------------
/recursion/matroska.py:
--------------------------------------------------------------------------------
 1 | def matroska(n):
 2 |     if n == 1:
 3 |         print('  '*n + 'матрёшечка')
 4 |     else:
 5 |         print('  '*n + 'матрёшка №', n, '(верх)')
 6 |         matroska(n-1)
 7 |         print('  '*n + 'матрёшка №', n, '(низ)')
 8 | 
 9 | def factorial(n):
10 |     if n == 0:
11 |         return 1
12 |     else:
13 |         print('  '*n + 'n =', n)  # прямой ход рекурсии
14 |         result = factorial(n-1)*n
15 |         print('  '*n + 'n =', n)  # обратный ход рекурсии
16 |         return result
17 | 
18 | counter = 0
19 | 
20 | def power(a, n):
21 |     global counter
22 |     counter += 1
23 |     
24 |     if n == 0:
25 |         return 1
26 |     elif n%2 == 0:
27 |         return power(a*a, n//2)
28 |     else:  # n - нечётное
29 |         return power(a, n-1)*a
30 | 
31 | def gcd(a, b):
32 |     if b == 0:
33 |         return a
34 |     else:
35 |         return gcd(b, a%b)
36 | 
37 | def gcd(a, b):
38 |     return a if b == 0 else gcd(b, a%b)
39 | 
40 |     
41 | 


--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
 1 | # Byte-compiled / optimized / DLL files
 2 | __pycache__/
 3 | *.py[cod]
 4 | *$py.class
 5 | 
 6 | # C extensions
 7 | *.so
 8 | 
 9 | # Distribution / packaging
10 | .Python
11 | env/
12 | build/
13 | develop-eggs/
14 | dist/
15 | downloads/
16 | eggs/
17 | .eggs/
18 | lib/
19 | lib64/
20 | parts/
21 | sdist/
22 | var/
23 | *.egg-info/
24 | .installed.cfg
25 | *.egg
26 | 
27 | # PyInstaller
28 | #  Usually these files are written by a python script from a template
29 | #  before PyInstaller builds the exe, so as to inject date/other infos into it.
30 | *.manifest
31 | *.spec
32 | 
33 | # Installer logs
34 | pip-log.txt
35 | pip-delete-this-directory.txt
36 | 
37 | # Unit test / coverage reports
38 | htmlcov/
39 | .tox/
40 | .coverage
41 | .coverage.*
42 | .cache
43 | nosetests.xml
44 | coverage.xml
45 | *,cover
46 | .hypothesis/
47 | 
48 | # Translations
49 | *.mo
50 | *.pot
51 | 
52 | # Django stuff:
53 | *.log
54 | local_settings.py
55 | 
56 | # Flask stuff:
57 | instance/
58 | .webassets-cache
59 | 
60 | # Scrapy stuff:
61 | .scrapy
62 | 
63 | # Sphinx documentation
64 | docs/_build/
65 | 
66 | # PyBuilder
67 | target/
68 | 
69 | # IPython Notebook
70 | .ipynb_checkpoints
71 | 
72 | # pyenv
73 | .python-version
74 | 
75 | # celery beat schedule file
76 | celerybeat-schedule
77 | 
78 | # dotenv
79 | .env
80 | 
81 | # virtualenv
82 | venv/
83 | ENV/
84 | 
85 | # Spyder project settings
86 | .spyderproject
87 | 
88 | # Rope project settings
89 | .ropeproject
90 | 


--------------------------------------------------------------------------------
/catch_the_ball/widgets_testing.py:
--------------------------------------------------------------------------------
 1 | import tkinter
 2 | 
 3 | 
 4 | def button1_command():
 5 |     print('Button 1 default command.')
 6 | 
 7 | 
 8 | def print_hello(event):
 9 |     print(event.num)
10 |     print(event.x, event.y)
11 |     #print(event.x_root, event.y_root)
12 |     me = event.widget
13 |     # что можно сделать с me?
14 |     if me == button1:
15 |         print('Hello!')
16 |     elif me == button2:
17 |         print('You pressed button 2!')
18 |     else:
19 |         raise ValueError()
20 | 
21 | 
22 | def init_main_window():
23 |     """
24 |     Инициализация главного окна: создание всех необходимых виджетов и их упаковка.
25 |     :return:
26 |     """
27 |     global root, button1, button2, label, text, scale
28 | 
29 |     root = tkinter.Tk()
30 | 
31 |     button1 = tkinter.Button(root, text="Button 1", command=button1_command)
32 |     button1.bind("<Button>", print_hello)
33 | 
34 |     button2 = tkinter.Button(root, text="Button 2")
35 |     button2.bind("<Button>", print_hello)
36 | 
37 |     variable = tkinter.IntVar(0)
38 |     label = tkinter.Label(root, textvariable=variable)
39 |     scale = tkinter.Scale(root, orient=tkinter.HORIZONTAL, length=300,
40 |                           from_=0, to=100, tickinterval=10, resolution=5, variable=variable)
41 |     text = tkinter.Entry(root, textvariable=variable)
42 | 
43 |     for obj in button1, button2, label, scale, text:
44 |         obj.pack()
45 | 
46 | if __name__ == "__main__":
47 |     init_main_window()
48 | 
49 |     root.mainloop()


--------------------------------------------------------------------------------
/x_and_o/x_and_o_ai.py:
--------------------------------------------------------------------------------
 1 | # field = " "*9
 2 | #координаты хода -- индекс позиции в строке: от 0 до 8
 3 | players = ['X', '0']
 4 | player = 0
 5 | 
 6 | 
 7 | def print_field(field):
 8 |     print(*field[:3])
 9 |     print(*field[3:6])
10 |     print(*field[6:])
11 | 
12 | 
13 | def do_turn(field, x, player):
14 |     return field[:x] + players[player] + field[x+1:]
15 | 
16 | 
17 | def ai_choice(field, player):
18 |     """ возвращает координаты хода AI """
19 |     # FIXME: тут нужно реализовать рекурсивный искусственный интеллект
20 |     return 0
21 | 
22 | 
23 | def human_choice(field, player):
24 |     """ возвращает координаты хода AI """
25 |     # FIXME: нельзя вводить тот номер клетки, где уже есть символ (кроме .)
26 |     return int(input("Введите номер клетки (от 0 до 8): "))
27 | 
28 | 
29 | def won(field, player):
30 |     """ определяет, выиграл ли игрок с номером player
31 |     """
32 |     char = players[player]
33 |     lines = 0
34 |     lines += (field[0:3] == char*3)
35 |     lines += (field[3:6] == char*3)
36 |     lines += (field[6:9] == char*3)
37 |     lines += (field[0::3] == char*3)
38 |     lines += (field[1::3] == char*3)
39 |     lines += (field[2::3] == char*3)
40 |     lines += (field[2::3] == char*3)
41 |     lines += (field[0::4] == char*3)  # главная диагональ
42 |     lines += (field[2::2] == char*3)  # вторая диагональ
43 |     return lines > 0
44 | 
45 | 
46 | def game_over(field):
47 |     """ определяет, закончилась ли игра (любым результатом, включая ничью)"""
48 |     if (field.find('.') == -1  # ничья
49 |         or won(field, 0) or won(field, 1)):
50 |         return True
51 |     else:
52 |         return False
53 | 
54 | 
55 | def tournir():
56 |     field = "."*9
57 |     while True:
58 |         print_field(field)
59 |         x = human_choice(field, 0)
60 |         field = do_turn(field, x, 0)
61 |         if game_over(field):
62 |             break
63 | 
64 |         print_field(field)
65 |         x = human_choice(field, 1)
66 |         field = do_turn(field, x, 1)
67 |         if game_over(field):
68 |             break
69 |     print_field(field)
70 |     print('победил кто-то...')
71 | 
72 | if __name__ == '__main__':
73 |     tournir()


--------------------------------------------------------------------------------
/graphs/count_components.py:
--------------------------------------------------------------------------------
 1 | import networkx
 2 | import matplotlib.pyplot as plt
 3 | 
 4 | color_list = ['red', 'green', 'blue', 'orange', 'magenta', 'pink', 'cyan']
 5 | 
 6 | def edges_list_to_adjacency_list(E):
 7 |     """E - граф в форме словаря рёбер и соответствующих им весов
 8 |     return граф в форме словаря словарей смежности с весами
 9 |     """
10 |     G = {}
11 |     for vertex1, vertex2 in E:
12 |         weight = E[(vertex1, vertex2)]
13 |         # добавляю ребро (vertex1, vertex2)
14 |         if vertex1 not in G:
15 |             G[vertex1] = {vertex2:weight}
16 |         else:  # значит такая вершина уже встречалась
17 |             G[vertex1][vertex2] = weight
18 |         # граф не направленный, поэтому добавляю ребро (vertex2, vertex1)
19 |         if vertex2 not in G:
20 |             G[vertex2] = {vertex1:weight}
21 |         else:  # значит такая вершина уже встречалась
22 |             G[vertex2][vertex1] = weight
23 |     return G
24 | 
25 | 
26 | def dfs(G, start, called=set(), skelet=set()):
27 |     called.add(start)
28 |     for neighbour in G[start]:
29 |         if neighbour not in called:
30 |             dfs(G, neighbour, called, skelet)
31 |             skelet.add((start, neighbour))
32 | 
33 | s = """L B 1
34 | B D 1
35 | B C 2
36 | G J 7
37 | V W 2
38 | N M 2
39 | C L 2
40 | O D 3
41 | G R 1
42 | R T 2
43 | N S 2
44 | Y W 5""".split('\n')
45 | E = {}
46 | for line in s:
47 |     a, b, weight = line.split()
48 |     E[(a, b)] = int(weight)
49 | 
50 | A = edges_list_to_adjacency_list(E)
51 | 
52 | G = networkx.Graph(A)
53 | position = networkx.spring_layout(G) # positions for all nodes
54 | networkx.draw(G, position)
55 | networkx.draw_networkx_labels(G, position)
56 | 
57 | called = set()
58 | count_components = 0
59 | for vertex in A:
60 |     if vertex in called:
61 |         continue
62 |     else:
63 |         # vertex ещё не встречалась ни в одной обойдённой компоненте связности
64 |         skelet = set()
65 |         dfs(A, vertex, called, skelet)
66 |         networkx.draw_networkx_edges(G, position, edgelist=skelet,
67 |                                      width=5, alpha=0.5,
68 |                                      edge_color=color_list[count_components])
69 |         count_components += 1
70 | 
71 | print('Количество компонент связности:', count_components)
72 | 
73 | plt.show() # display
74 | 


--------------------------------------------------------------------------------
/graphs/input_graph.py:
--------------------------------------------------------------------------------
 1 | import networkx
 2 | import matplotlib.pyplot as plt
 3 | 
 4 | def input_edges_list():
 5 |     """считывает список рёбер в форме:
 6 |     в первой строке N - число рёбер,
 7 |     затем следует N строк из двух слов и одного числа
 8 |     слова - названия вершин, концы ребра, а число - его вес
 9 |     
10 |     return граф в форме словаря рёбер и соответствующих им весов
11 |     """
12 |     N = int(input('Введите количество рёбер:'))
13 |     G = {}
14 |     for i in range(N):
15 |         vertex1, vertex2, weight = input().split()
16 |         weight = float(weight)
17 |         G[(vertex1, vertex2)] = weight
18 |     return G
19 |     
20 | def edges_list_to_adjacency_list(E):
21 |     """E - граф в форме словаря рёбер и соответствующих им весов
22 |     return граф в форме словаря словарей смежности с весами
23 |     """
24 |     G = {}
25 |     for vertex1, vertex2 in E:
26 |         weight = E[(vertex1, vertex2)]
27 |         # добавляю ребро (vertex1, vertex2)
28 |         if vertex1 not in G:
29 |             G[vertex1] = {vertex2:weight}
30 |         else:  # значит такая вершина уже встречалась
31 |             G[vertex1][vertex2] = weight
32 |         # граф не направленный, поэтому добавляю ребро (vertex2, vertex1)
33 |         if vertex2 not in G:
34 |             G[vertex2] = {vertex1:weight}
35 |         else:  # значит такая вершина уже встречалась
36 |             G[vertex2][vertex1] = weight
37 |     return G
38 | 
39 | 
40 | def dfs(G, start, called = set(), skelet = set()):
41 |     called.add(start)
42 |     for neighbour in G[start]:
43 |         if neighbour not in called:
44 |             dfs(G, neighbour, called, skelet)
45 |             skelet.add((start, neighbour))
46 | 
47 | 
48 | 
49 | s = """A B 1
50 | B D 1
51 | B C 2
52 | C A 2
53 | C D 3
54 | D E 5""".split('\n')
55 | E = {}
56 | for line in s:
57 |     a, b, weight = line.split()
58 |     E[(a, b)] = int(weight)
59 | 
60 | A = edges_list_to_adjacency_list(E)
61 | 
62 | called = set()
63 | skelet = set()
64 | dfs(A, 'A', called, skelet)
65 | print(called)
66 | print(skelet)
67 | 
68 | G = networkx.Graph(A)
69 | position = networkx.spring_layout(G) # positions for all nodes
70 | networkx.draw(G, position)
71 | networkx.draw_networkx_labels(G, position)
72 | networkx.draw_networkx_edge_labels(G, position, edge_labels=E)
73 | # нарисуем остовное дерево:
74 | networkx.draw_networkx_edges(G, position, edgelist=skelet,
75 |                              width=5, alpha=0.5, edge_color='red')
76 | 
77 | plt.show() # display
78 | 


--------------------------------------------------------------------------------
/massives/sorting.py:
--------------------------------------------------------------------------------
 1 | 
 2 | def sort_test(my_sort):
 3 |     import random
 4 | 
 5 |     A = [1, 2, 3, 4, 5, 6]
 6 |     A_ans = [1, 2, 3, 4, 5, 6]
 7 |     my_sort(A)
 8 |     print('test case #1: ' + ('OK' if A == A_ans else 'Fail'))
 9 | 
10 |     A = [-1, -2, -3, -4, -5, -6]
11 |     A_ans = [-6, -5, -4, -3, -2, -1]
12 |     my_sort(A)
13 |     print('test case #2: ' + ('OK' if A == A_ans else 'Fail'))
14 | 
15 |     A = [-1, 2, -3, 4, -5, 6]
16 |     A_ans = [-5, -3, -1, 2, 4, 6]
17 |     my_sort(A)
18 |     print('test case #3: ' + ('OK' if A == A_ans else 'Fail'))
19 | 
20 |     A = [1000]
21 |     A_ans = [1000]
22 |     my_sort(A)
23 |     print('test case #4: ' + ('OK' if A == A_ans else 'Fail'))
24 | 
25 |     A = []
26 |     A_ans = []
27 |     my_sort(A)
28 |     print('test case #5: ' + ('OK' if A == A_ans else 'Fail'))
29 | 
30 |     A = [5]*100
31 |     A_ans = [5]*100
32 |     my_sort(A)
33 |     print('test case #6: ' + ('OK' if A == A_ans else 'Fail'))
34 | 
35 |     A = [random.randint(1, 100) for i in range(1000)]
36 |     A_ans = sorted(A)
37 |     my_sort(A)
38 |     print('test case #7: ' + ('OK' if A == A_ans else 'Fail'))
39 | 
40 |     A = [[2], [1], [3], [5], [4], [5]]
41 |     A_ans = sorted(A)
42 |     my_sort(A)
43 |     print('test case #8: ' + ('OK' if A == A_ans else 'Fail'))
44 | 
45 | 
46 | 
47 | def do_nothing(A):
48 |     pass
49 | 
50 | 
51 | def bubble_sort(A):
52 |     N = len(A)
53 |     for prohod in range(1, N):
54 |         for i in range(N-prohod):
55 |             if A[i] > A[i+1]:
56 |                 tmp = A[i]
57 |                 A[i] = A[i+1]
58 |                 A[i+1] = tmp
59 | 
60 | 
61 | def choice_sort(A):
62 |     N = len(A)
63 |     for pos in range(0, N-1):
64 |         for i in range(pos+1, N):
65 |             if A[i] < A[pos]:
66 |                 A[pos], A[i] = A[i], A[pos]
67 | 
68 | 
69 | def insert_sort(A):
70 |     N = len(A)
71 |     for pos in range(1, N):
72 |         # УВЕРЕН, что список отсортирован в позициях с 0-й по (pos-1)-ю включительно
73 |         i = 0
74 |         while A[i] < A[pos]:
75 |             i += 1
76 |         # УВЕРЕН, что i указывает на элемент не меньше вставляемого
77 |         tmp = A[pos]
78 |         for k in range(pos-1, i-1, -1):
79 |             A[k+1] = A[k]
80 |         A[i] = tmp
81 |         # УВЕРЕН, что список отсортирован в позициях с 0-й по pos-ю включительно
82 | 
83 | if __name__ == '__main__':
84 |     print('Test Bubble Sort:')
85 |     sort_test(bubble_sort)
86 |     print('Test Choice Sort:')
87 |     sort_test(choice_sort)
88 |     print('Test Insert Sort:')
89 |     sort_test(insert_sort)
90 | 
91 | 


--------------------------------------------------------------------------------
/волновой алгоритм/task.py:
--------------------------------------------------------------------------------
  1 | #-*- coding: utf-8 -*
  2 | import robot
  3 | r = robot.rmap()
  4 | r.lm('task10-5')
  5 | def task():
  6 |     pass
  7 |     #------- пишите код здесь -----
  8 | 
  9 |     queue = [r.getCoords()]
 10 |     step = 0
 11 |     r.settext(step)
 12 |     find = False
 13 |     while queue and not find:
 14 |         q1 = []
 15 |         while queue:
 16 |             r.jumpTo(queue.pop())
 17 |             if r.freeRight():
 18 |                 r.right()
 19 |                 if r.isPark():
 20 |                     find = True
 21 |                     break
 22 |                 if r.gettext() == '':
 23 |                     q1.append(r.getCoords())
 24 |                     r.settext(step+1)
 25 |                 r.left()
 26 |             if r.fl():
 27 |                 r.lt()
 28 |                 if r.isPark():
 29 |                     find = True
 30 |                     break
 31 |                 if r.gettext() == '':
 32 |                     q1.append(r.getCoords())
 33 |                     r.settext(step+1)
 34 |                 r.rt()
 35 |             if r.fu():
 36 |                 r.up()
 37 |                 if r.isPark():
 38 |                     find = True
 39 |                     break
 40 |                 if r.gettext() == '':
 41 |                     q1.append(r.getCoords())
 42 |                     r.settext(step+1)
 43 |                 r.dn()
 44 |             if r.freeDown():
 45 |                 r.down()
 46 |                 if r.isPark():
 47 |                     find = True
 48 |                     break
 49 |                 if r.gettext() == '':
 50 |                     q1.append(r.getCoords())
 51 |                     r.settext(step+1)
 52 |                 r.up()
 53 |         queue = q1[:]
 54 |         step += 1
 55 | 
 56 |     def tomin():
 57 |         """ шагает из текущей клетки в соседнюю,
 58 |         в которой минимальное значение
 59 |         возвращает количество шагов от текущей до начала """
 60 | 
 61 |         coords = []
 62 |         texts = []
 63 |         if r.fr():
 64 |             r.rt()
 65 |             texts.append(r.gettext())
 66 |             coords.append(r.getCoords())
 67 |             r.lt()
 68 |         if r.fl():
 69 |             r.lt()
 70 |             texts.append(r.gettext())
 71 |             coords.append(r.getCoords())
 72 |             r.rt()
 73 |         if r.fd():
 74 |             r.dn()
 75 |             texts.append(r.gettext())
 76 |             coords.append(r.getCoords())
 77 |             r.up()
 78 |         if r.fu():
 79 |             r.up()
 80 |             texts.append(r.gettext())
 81 |             coords.append(r.getCoords())
 82 |             r.dn()
 83 |         r.pt()
 84 |         # везде, где текст в ячейке не является числом -- ставим 10000
 85 |         texts[:] = [10000 if x == '' else x for x in texts]
 86 |         print(min(texts))
 87 |         print(texts.index(min(texts)))
 88 |         print(coords[texts.index(min(texts))])
 89 |         r.jumpTo (coords[texts.index(min(texts))])
 90 |         return min(texts)
 91 | 
 92 |     if find:
 93 |         while tomin() > 0:
 94 |             pass
 95 |     else:
 96 |         r.paint('red')
 97 |     
 98 |     #------- пишите код здесь -----
 99 | r.start(task)
100 | 


--------------------------------------------------------------------------------
/catch_the_ball/ball.py:
--------------------------------------------------------------------------------
  1 | import tkinter
  2 | from random import choice, randint
  3 | from math import cos, sin, pi
  4 | import time
  5 | import signal
  6 | 
  7 | ball_initial_number = 10
  8 | ball_minimal_radius = 10
  9 | ball_maximal_radius = 40
 10 | 
 11 | #ball_available_colors = '0123456789ABCDEF'#['green', 'blue', 'red', 'lightgray', '#FF00FF', '#FFFF00']
 12 | #balls_coord = []#список координат шариков
 13 | #balls_num = []#список номеров шариков
 14 | 
 15 | ball_available_colors = ['green', 'blue', 'red', 'lightgray', '#FF00FF', '#FFFF00']
 16 | ball_bonus_for_color = [       2,      2,     3,           1,         1,         1]
 17 | balls = list()
 18 | step_fly = 1.5
 19 | bonus = 0
 20 | 
 21 | def accumulation_of_bonus(color):
 22 |     """
 23 |     За подбитые шарики основного цвета дается 2 балл,
 24 |     за шарики дополнительных цветов - 1 балл
 25 |     :param color:
 26 |     :return:
 27 |     """
 28 |     bonus = ball_bonus_for_color[ball_available_colors.index(color)]
 29 |     label_bonus["text"] =  str(int(label_bonus["text"]) + bonus)
 30 | 
 31 | 
 32 | def click_ball(event):
 33 |     """
 34 |     Обработчик событий от мышки для игрового холста
 35 |     :param event:мышка указывет
 36 |      По клику мышкой нужно удалять тот объект, на который
 37 |      А также засчитывать его очки
 38 |     :return:
 39 |     """
 40 |     obj = canvas.find_closest(event.x, event.y)
 41 |     x1, y1, x2, y2 = canvas.coords(obj)
 42 |     R = (x2 - x1) / 2
 43 |     xc = x1 + R
 44 |     yc = y1 + R
 45 |     i = 0
 46 |     while (i < len(balls)) and (obj[0] != balls[i][1]):
 47 |         i += 1
 48 |     if i < len(balls) and (xc - event.x)**2 + (yc - event.y) ** 2 <= R**2:
 49 |         accumulation_of_bonus(canvas.itemcget( obj[0], "fill"))
 50 |         canvas.delete(balls[i][1])
 51 |         balls[:i+1] = balls[:i]
 52 |         create_random_ball()
 53 | 
 54 | def move_all_balls():
 55 |     """
 56 |     передвигат все шарики на чуть-чуть
 57 |     :return:
 58 |     """
 59 |     for obj in canvas.find_all():
 60 |         dx = randint(-1, 1)
 61 |         dy = randint(-1, 1)
 62 |         canvas.move(obj, dx, dy)
 63 | 
 64 | def create_random_ball():
 65 |     """
 66 |     создает шарик в случайном месте игрового холста
 67 |     шарик не выходит за границу игрового поля
 68 |     :return:
 69 |     """
 70 |     global balls
 71 |     R = randint(ball_minimal_radius, ball_maximal_radius)
 72 |     x = randint(0+R, int(canvas['width'])-1-R)
 73 |     y = randint(0+R, int(canvas['width'])-1-R)
 74 |     angle = randint(0,359)
 75 |     id_oval = canvas.create_oval(x-R,y-R,x+R, y+R, width=1, fill=random_color())
 76 |     balls.append([angle, id_oval])
 77 | 
 78 | 
 79 | def random_color():
 80 |     """
 81 |     случайный цвет из некоторого набора цветов
 82 |     :return:
 83 |     """
 84 |     return choice(ball_available_colors)
 85 | 
 86 | def init_ball_catch_game():
 87 |     """
 88 |      Создает необхоимое для игры количство шариков,по которым нужно будет кликать
 89 | 
 90 |      """
 91 |     for i in range(ball_initial_number):
 92 |         create_random_ball()
 93 | 
 94 | 
 95 | def init_main_window():
 96 |     """
 97 |     Инициализация главного окна
 98 |         :return:
 99 |     """
100 |     global root, frame_bonus,frame_canvas, label_bonus, canvas
101 |     root  = tkinter.Tk()
102 |     frame_bonus = tkinter.Frame(root)
103 |     label_caption = tkinter.Label(frame_bonus, text="  Накопленные очки  ", width=20, font="Calibri 14")
104 |     label_bonus = tkinter.Label(frame_bonus, text="0", font="Calibri 14")
105 |     label_caption.grid(row=0, column=0)
106 |     label_bonus.grid(row=0, column=1)
107 |     frame_bonus.pack()
108 | 
109 |     frame_canvas = tkinter.Frame(root)
110 |     frame_canvas.pack()
111 | 
112 |     canvas = tkinter.Canvas(frame_canvas, background='white', width=400, height=400)
113 |     canvas.bind('<Button>', click_ball)
114 |     canvas.pack()
115 | 
116 | def gradus_to_radians(angle_in_gradus):
117 |     return angle_in_gradus * pi / 180
118 | 
119 | def move_balls():
120 |     for i in range(len(balls)):
121 |         x1, y1, x2, y2 = canvas.coords(balls[i][1])
122 |         if y1 <= 0:
123 |             balls[i][0] = 360 - balls[i][0]
124 |         elif y2 >= 400:
125 |             balls[i][0] = 360 - balls[i][0]
126 |         elif x1 <= 0:
127 |             balls[i][0] = 180 - balls[i][0]
128 |         elif x2 >= 400:
129 |             balls[i][0] = 180 - balls[i][0]
130 |         dx = step_fly * cos(gradus_to_radians(balls[i][0]))
131 |         dy = step_fly * sin(gradus_to_radians(balls[i][0]))
132 |         canvas.move(balls[i][1],dx,  dy)
133 | 
134 | 
135 | 
136 | def main():
137 |      move_balls()
138 |      root.after(30, main)
139 | 
140 | if __name__ == "__main__":
141 |     init_main_window()
142 |     init_ball_catch_game()
143 |     main()
144 |     root.mainloop()
145 | 
146 |     print("Приходите поиграть еще!")
147 | 
148 | 


--------------------------------------------------------------------------------
/life_game/life_game.py:
--------------------------------------------------------------------------------
  1 | from tkinter import *
  2 | 
  3 | frame_sleep_time = 1   # задержка между кадрами в милисекундах
  4 | 
  5 | cell_width = 10
  6 | cell_height = 10
  7 | cells_horizontal_number = 100
  8 | cells_vertical_number = 100
  9 | max_physical_x = cells_horizontal_number
 10 | max_physical_y = cells_vertical_number
 11 | screen_width = cell_width * cells_horizontal_number    # ширина игрового экрана
 12 | screen_height = cell_height * cells_vertical_number    # высота игрового экрана
 13 | 
 14 | 
 15 | def screen_x(_physical_x):
 16 |     return round(_physical_x * cell_width)
 17 | 
 18 | 
 19 | def screen_y(_physical_y):
 20 |     return screen_height - round(_physical_y * cell_height)
 21 | 
 22 | 
 23 | def physical_x(_screen_x):
 24 |     return _screen_x / cell_width
 25 | 
 26 | 
 27 | def physical_y(_screen_y):
 28 |     return (screen_height - _screen_y) / cell_height
 29 | 
 30 | 
 31 | def cell_color(symbol):
 32 |     colors = {0: 'white', 1: 'green', ' ': None}
 33 |     return colors[symbol]
 34 | 
 35 | 
 36 | def cell_outline_color(symbol):
 37 |     colors = {0: 'lightgray', 1: 'lightgray', ' ': None}
 38 |     return colors[symbol]
 39 | 
 40 | 
 41 | class Field:
 42 |     def __init__(self, field_file, canvas):
 43 |         """загружает поле с клетками из файла"""
 44 |         self._canvas = canvas
 45 |         with open(field_file) as file:
 46 |             self.matrix = [None] * cells_vertical_number
 47 |             self.avatars = [None] * cells_vertical_number
 48 |             for yi in range(cells_vertical_number):
 49 |                 self.matrix[yi] = [None] * cells_horizontal_number
 50 |                 self.avatars[yi] = [None] * cells_horizontal_number
 51 |                 line = file.readline().rstrip()
 52 |                 line += ' '*(cells_horizontal_number - len(line))
 53 |                 for xi in range(cells_horizontal_number):
 54 |                     # любой символ, кроме пробела -- значикт соотв. клетка жива
 55 |                     is_cell_alive = 0 if line[xi] == ' ' else 1
 56 |                     self.matrix[yi][xi] = is_cell_alive
 57 |                     self.avatars[yi][xi] = canvas.create_rectangle(screen_x(xi), screen_y(yi),
 58 |                                                                    screen_x(xi+1), screen_y(yi+1),
 59 |                                                                    fill=cell_color(is_cell_alive),
 60 |                                                                    outline=cell_outline_color(is_cell_alive))
 61 | 
 62 |     def calculate(self):
 63 |         """  """
 64 |         # рассчитываем матрицу состояний клеток на следующем шаге
 65 |         new_matrix = [[0]*cells_horizontal_number for i in range(cells_vertical_number)]
 66 |         for yi in range(1, cells_vertical_number-1):
 67 |             for xi in range(1, cells_horizontal_number-1):
 68 |                 # подсчитаем количество живых соседей
 69 |                 number_of_neighbours = 0
 70 |                 for i in range(-1, 2):
 71 |                     for j in range(-1, 2):
 72 |                         number_of_neighbours += self.matrix[yi+i][xi+j]
 73 |                 number_of_neighbours -= self.matrix[yi][xi]
 74 |                 cell_is_alive = self.matrix[yi][xi]
 75 |                 if (cell_is_alive and number_of_neighbours == 2) or number_of_neighbours == 3:
 76 |                     new_matrix[yi][xi] = 1
 77 |                 else:
 78 |                     new_matrix[yi][xi] = 0
 79 |         # копируем рассчитанную матрицу в self.matrix
 80 |         for yi in range(1, cells_vertical_number-1):
 81 |             for xi in range(1, cells_horizontal_number-1):
 82 |                 if self.matrix[yi][xi] != new_matrix[yi][xi]:
 83 |                     self.matrix[yi][xi] = new_matrix[yi][xi]
 84 |                     self._canvas.delete(self.avatars[yi][xi])
 85 |                     self.avatars[yi][xi] = self._canvas.create_rectangle(screen_x(xi), screen_y(yi),
 86 |                                                                          screen_x(xi+1), screen_y(yi+1),
 87 |                                                                          fill=cell_color(new_matrix[yi][xi]),
 88 |                                                                          outline=cell_outline_color(new_matrix[yi][xi]))
 89 | 
 90 | 
 91 | def time_event():
 92 |     global scores
 93 |     # перевычислить состояние поля с клетками
 94 |     field.calculate()
 95 |     canvas.after(frame_sleep_time, time_event)
 96 | 
 97 | 
 98 | def mouse_move(event):
 99 |     pass
100 | 
101 | 
102 | def mouse_click(event):
103 |     pass
104 | 
105 | 
106 | if __name__ == "__main__":
107 |     root = Tk()
108 |     canvas = Canvas(root, width=screen_width, height=screen_height)
109 |     canvas.pack()
110 |     canvas.bind('<Motion>', mouse_move)
111 | 
112 |     field = Field('map2.txt', canvas)
113 | 
114 |     time_event()  # начинаю циклически запускать таймер
115 |     root.mainloop()
116 | 


--------------------------------------------------------------------------------
/the_gun/gun.py:
--------------------------------------------------------------------------------
  1 | from tkinter import *
  2 | from random import choice, randint
  3 | 
  4 | screen_width = 400
  5 | screen_height = 300
  6 | timer_delay = 50
  7 | gravitational_acceleration = 0
  8 | dt = 2  # квант физического времени
  9 | 
 10 | 
 11 | class MovingUnit:
 12 |     """
 13 |     Абстрактный класс -- предок для шариков-мишеней и для снарядов.
 14 |     Имеет атрибуты x, y, Vx, Vy, R, avatar
 15 |     а также метод fly -- абстрактный (т.е. его нельзя реально вызывать)
 16 |     """
 17 |     def __init__(self, x, y, Vx, Vy, R, avatar):
 18 |         self._R = R
 19 |         self._x = x
 20 |         self._y = y
 21 |         self._Vx = Vx
 22 |         self._Vy = Vy
 23 |         self._avatar = avatar
 24 |         self._deleted = False
 25 | 
 26 |     def fly(self):
 27 |         """
 28 |         Абстрактный метод! Нельзя вызывать.
 29 |         Требуется реализовывать в классах-потомках.
 30 |         """
 31 |         raise RuntimeError()
 32 | 
 33 |     def delete(self):
 34 |         """
 35 |         Удаляет объект с холста, если он ещё не удалён
 36 |         и помечает его как удалённый.
 37 |         """
 38 |         if not self._deleted:
 39 |             canvas.delete(self._avatar)
 40 |             self._deleted = True
 41 | 
 42 |     def deleted(self):
 43 |         """
 44 |         :return: True, если объект уже удалён
 45 |         """
 46 |         return self._deleted
 47 | 
 48 | 
 49 | class Shell(MovingUnit):
 50 |     """
 51 |     Снаряд, вылетающий из пушки.
 52 |     Не отражается от стенок, уничтожается, если вылетел за пределы поля.
 53 |     Двигается по гравитационной траектории.
 54 |     """
 55 |     radius = 5
 56 |     maximal_number = 3
 57 |     color = 'black'
 58 | 
 59 |     def __init__(self, x, y, Vx, Vy):
 60 |         """
 61 | 
 62 |         """
 63 |         R = Shell.radius
 64 |         avatar = canvas.create_oval(x, y, x+2*R, y+2*R,
 65 |                                           width=1, fill=Shell.color,
 66 |                                           outline=Shell.color)
 67 |         super().__init__(x, y, Vx, Vy, R, avatar)
 68 | 
 69 |     def fly(self):
 70 |         ax = 0
 71 |         ay = gravitational_acceleration
 72 |         self._x += self._Vx*dt + ax*dt**2/2
 73 |         self._y += self._Vy*dt + ay*dt**2/2
 74 |         self._Vx += ax*dt
 75 |         self._Vy += ay*dt
 76 |         canvas.coords(self._avatar, self._x, self._y,
 77 |                       self._x + 2*self._R, self._y + 2*self._R)
 78 |         # FIXME: пока никак не отслеживается вылет за пределы поля, когда снаряд надо уничтожать
 79 | 
 80 | 
 81 | class Ball(MovingUnit):
 82 |     initial_number = 20
 83 |     minimal_radius = 15
 84 |     maximal_radius = 40
 85 |     available_colors = ['green', 'blue', 'red']
 86 | 
 87 |     def __init__(self):
 88 |         """
 89 |         Cоздаёт шарик в случайном месте игрового холста canvas,
 90 |         при этом шарик не выходит за границы холста!
 91 |         """
 92 |         R = randint(Ball.minimal_radius, Ball.maximal_radius)
 93 |         x = randint(0, screen_width-1-2*R)
 94 |         y = randint(0, screen_height-1-2*R)
 95 |         Vx = randint(-2, +2)
 96 |         Vy = randint(-2, +2)
 97 | 
 98 |         fillcolor = choice(Ball.available_colors)
 99 |         avatar = canvas.create_oval(x, y, x+2*R, y+2*R,
100 |                                           width=1, fill=fillcolor,
101 |                                           outline=fillcolor)
102 |         super().__init__(x, y, Vx, Vy, R, avatar)
103 | 
104 |     def fly(self):
105 |         self._x += self._Vx
106 |         self._y += self._Vy
107 |         # отбивается от горизонтальных стенок
108 |         if self._x < 0:
109 |             self._x = 0
110 |             self._Vx = -self._Vx
111 |         elif self._x + 2*self._R >= screen_width:
112 |             self._x = screen_width - 2*self._R -1
113 |             self._Vx = -self._Vx
114 |         # отбивается от вертикальных стенок
115 |         if self._y < 0:
116 |             self._y = 0
117 |             self._Vy = -self._Vy
118 |         elif self._y + 2*self._R >= screen_height:
119 |             self._y = screen_height - 2*self._R  - 1
120 |             self._Vy = -self._Vy
121 | 
122 |         canvas.coords(self._avatar, self._x, self._y,
123 |                       self._x + 2*self._R, self._y + 2*self._R)
124 | 
125 | 
126 | class Gun:
127 |     def __init__(self):
128 |         self._x = 0
129 |         self._y = screen_height-1
130 |         self._lx = +30
131 |         self._ly = -30
132 |         self._avatar = canvas.create_line(self._x, self._y,
133 |                                           self._x+self._lx,
134 |                                           self._y+self._ly)
135 | 
136 |     def shoot(self):
137 |         """
138 |         :return возвращает объект снаряда (класса Shell)
139 |         """
140 |         shell = Shell(self._x + self._lx, self._y + self._ly,
141 |                       self._lx/10, self._ly/10)
142 |         return shell
143 | 
144 | 
145 | def init_game():
146 |     """
147 |     Создаём необходимое для игры количество объектов-шариков,
148 |     а также объект - пушку.
149 |     """
150 |     global balls, gun, shells_on_fly
151 |     balls = [Ball() for i in range(Ball.initial_number)]
152 |     gun = Gun()
153 |     shells_on_fly = []
154 | 
155 | 
156 | def init_main_window():
157 |     global root, canvas, scores_text, scores_value
158 |     root = Tk()
159 |     root.title("Пушка")
160 |     scores_value = IntVar()
161 |     canvas = Canvas(root, width=screen_width, height=screen_height,
162 |                     bg="white")
163 |     scores_text = Entry(root, textvariable=scores_value)
164 |     canvas.grid(row=1, column=0, columnspan=3)
165 |     scores_text.grid(row=0, column=2)
166 |     canvas.bind('<Button-1>', click_event_handler)
167 | 
168 | 
169 | def remove_deleted_units_from_list(units):
170 |     delta = 0
171 |     for i in range(len(units)):
172 |         if units[i].deleted():
173 |             delta += 1
174 |         else:
175 |             units[i-delta] = units[i]
176 |             print(1)
177 |     units[:] = units[:-delta]
178 | 
179 | 
180 | def distance(unit1, unit2):
181 |     """
182 |     :param unit1: шарик или снаряд
183 |     :param unit2: шарик или снаряд
184 |     :return: расстояние межде поверхностями шариков
185 |     """
186 |     dx = unit1._x - unit2._x
187 |     dy = unit1._y - unit2._y
188 |     L = (dx**2 + dy**2)**0.5
189 |     return L - unit1._R - unit2._R
190 | 
191 | def timer_event():
192 |     # все периодические рассчёты, которые я хочу, делаю здесь
193 |     for ball in balls:
194 |         ball.fly()
195 |     for shell in shells_on_fly:
196 |         shell.fly()
197 | 
198 |     for shell in shells_on_fly:
199 |         for ball in balls:
200 |             if distance(ball, shell) <= 0:
201 |                 # удалить данный шарик и данный снаряд
202 |                 shell.delete()
203 |                 ball.delete()
204 |         remove_deleted_units_from_list(balls)
205 | 
206 |     remove_deleted_units_from_list(shells_on_fly)
207 |     canvas.after(timer_delay, timer_event)
208 | 
209 | 
210 | def click_event_handler(event):
211 |     global shells_on_fly
212 |     shell = gun.shoot()
213 |     shells_on_fly.append(shell)
214 | 
215 | if __name__ == "__main__":
216 |     init_main_window()
217 |     init_game()
218 |     timer_event()
219 |     root.mainloop()


--------------------------------------------------------------------------------
/life_game/map1.txt:
--------------------------------------------------------------------------------
 1 |                                                                                  
 2 |                                                                                  
 3 |                                                                                  
 4 |                                                                                  
 5 |                                                                                  
 6 |                                                                                  
 7 |                                                                                  
 8 |                                                                                  
 9 |                                                                                  
10 |                                                                                  
11 |                                                                                  
12 |                                                                                  
13 |                                                                              
14 |                                                                                  
15 |                                                 
16 |                                                                                  
17 |                                                                                  
18 |                                                                                  
19 |                                                                                  
20 |                                                 
21 |                                                                                  
22 |                                                                                  
23 |                                                                                  
24 |                                                                                  
25 |                                                                                  
26 |                                                                                  
27 |                                                                                  
28 |                                                                                  
29 |                                                                                  
30 |                                                                                  
31 |                                                                                  
32 |                                                                                  
33 |                                                                                  
34 |                                                                                  
35 |                                                                               
36 |                                                                                  
37 |                                                                                  
38 |                                                                                  
39 |                                                                                  
40 |                                                                                  
41 |                                                                              
42 |                                                                                  
43 |                                                                                  
44 |                                                                                  
45 |                                                                                  
46 |                                                                                  
47 |                                                                                  
48 |                                                                                  
49 |                                                                                  
50 |                                                                                  
51 |                                                                                  
52 |                                                                                  
53 |                                                                                  
54 |                                                                                  
55 |                                                                                  
56 |                                                                                  
57 |                                                                                  
58 |                                                                                  
59 |                                                                                  
60 |                                                                                  
61 |                                                                                  
62 |                                                                                  
63 |                                                                                  
64 |                                                                                  
65 |                                                                                  
66 |                                                                                  
67 |                                                                                  
68 |                                                                                  
69 |                                                                                  
70 |                                                                                  
71 |                                                                                  
72 |                                                                                  
73 |                                                                                  
74 |                                                                                  
75 |                                                                                  
76 |                                                                                  
77 |                                                                                  
78 |                                                                                  
79 |                                                                                  
80 |                                                                                  
81 |                                                                                  
82 |                                                                                  
83 |                                                                                  
84 |                                                                                  
85 |                                                                                  
86 |                                                                                  
87 |                                                                                  
88 |                                                                                  
89 |                                                                                  
90 |                                                                                  
91 |                                                                                  
92 |                                                                                  
93 |                                                                                  
94 |                                                               0
95 |                                                              000                 
96 |                                                              0


--------------------------------------------------------------------------------
/life_game/map2.txt:
--------------------------------------------------------------------------------
 1 |                                                                                  
 2 |                                                                                  
 3 |                                                                                  
 4 |         0000                                                                      
 5 |                                                                                  
 6 |                                                       00000             
 7 |                                                                                  
 8 |                                                                                  
 9 |                                                                                  
10 |                                                                                  
11 |                                 000                                                 
12 |                                                                                  
13 |                                                                              
14 |                                                                                  
15 |                                                 
16 |                 000                                                                 
17 |                 0 0                                                                
18 |                 00                                                                
19 |                                                     00                             
20 |                                                     00
21 |                                                                                  
22 |                                                                                  
23 |                                                                                  
24 |                                                                                  
25 |                                                                                  
26 |                                                                                  
27 |                                                                                  
28 |                                                                                  
29 |                                                                                  
30 |                                                                                  
31 |                                                                                  
32 |                                                                                  
33 |                                                                                  
34 |                                                                                  
35 |                                                                               
36 |                                                                                  
37 |                                                                                  
38 |                                                                                  
39 |                                                                                  
40 |                                                                                  
41 |                                                                              
42 |                                                                                  
43 |                                                                                  
44 |                                                                                  
45 |                                                                                  
46 |                                                                                  
47 |                                                                                  
48 |                                                                                  
49 |                                                                                  
50 |                                                                                  
51 |                                                                                  
52 |                                                                                  
53 |                                                                                  
54 |                                                                                  
55 |                                                                                  
56 |                                                                                  
57 |                                                                                  
58 |                                                                                  
59 |                                                                                  
60 |                                                                                  
61 |                                                                                  
62 |                                                                                  
63 |                                                                                  
64 |                                                                                  
65 |                                                                                  
66 |                                                                                  
67 |                                                                                  
68 |                                                                                  
69 |                                                                                  
70 |                                                                                  
71 |                                                                                  
72 |                                                                                  
73 |                                                                                  
74 |                                                                                  
75 |                                                                                  
76 |                                                                                  
77 |                                                                                  
78 |                                                                                  
79 |                                                                                  
80 |                                                                                  
81 |                                                                                  
82 |                                                                                  
83 |                                                                                  
84 |                                                                                  
85 |                                                                                  
86 |                                                                                  
87 |                                                                                  
88 |                                                                                  
89 |                                                                                  
90 |                                                                                  
91 |                                                                                  
92 |                                                                                  
93 |                                                                                  
94 |                                                               0
95 |                                                              000                 
96 |                                                              0


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     {one line to give the program's name and a brief idea of what it does.}
635 |     Copyright (C) {year}  {name of author}
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <http://www.gnu.org/licenses/>.
649 | 
650 | Also add information on how to contact you by electronic and paper mail.
651 | 
652 |   If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 | 
655 |     {project}  Copyright (C) {year}  {fullname}
656 |     This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 |     This is free software, and you are welcome to redistribute it
658 |     under certain conditions; type `show c' for details.
659 | 
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License.  Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 | 
664 |   You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | <http://www.gnu.org/licenses/>.
668 | 
669 |   The GNU General Public License does not permit incorporating your program
670 | into proprietary programs.  If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library.  If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License.  But first, please read
674 | <http://www.gnu.org/philosophy/why-not-lgpl.html>.
675 | 


--------------------------------------------------------------------------------