neizod

neizod

neizod

#!/usr/bin/env python3

import sys
from argparse import ArgumentParser
from itertools import combinations
from random import seed, shuffle, randrange


sumsupto = lambda n: n*(n+1)//2
tco = lambda t: f'\033[01;{31+t[1]}m{t[0]:02}\033[00m'

neizod

#!/usr/bin/env python3


# NOTE
# LAYERS is a non-empty list of integers.
# The n-gon can be determine by calc_ngon(LAYERS), e.g.,
#LAYERS = [1, 2, 2]                      # heptagon (not constructible)
#LAYERS = [1, 4, 3]                      # heptadecagon (17 sides)
#LAYERS = [2, 2, 3, 2]                   # tetracontadigon (42)
#LAYERS = [4, 1, 4, 3, 2, 2]             # 360-gon

neizod

#!/usr/bin/env python3


# change params here

N = 3
M = 3
PRINT_UNIQUE_ANSWERS = True

neizod

#!/usr/bin/env python3

from itertools import combinations


def is_undividable_clique(family, number):
    for subgraph in combinations(family, 4):
        if sum(subgraph) % number == 0:
            return False
    return True

neizod

neizod

import sys
from operator import iconcat
from functools import reduce

sys.setrecursionlimit(100010)


class Node(object):
    def __init__(self):
        self.fun = 0

neizod

#!/usr/bin/env python3

import random

UPPER_BOUND = 10**9
BINARY_BOUND = len(f'{UPPER_BOUND:b}')


def is_binary(x):
    return x == 2**len(f'{x:b}')

neizod

/*
 *       | y
 *       |
 *       .
 *     /   \
 * z /       \ x
 *
 */

const scene = new THREE.Scene();