neizod

0 [41576]: ( ( 9 / ( 9 / 9 ) ) - 9 )
1 [34859]: ( ( 9 / ( 9 / 9 ) ) / 9 )
2 [33122]: ( ( 9 / 9 ) + ( 9 / 9 ) )
3 [31653]: ( ( 9 + ( 9 + 9 ) ) / 9 )
4 [31717]: ( 9 / ( ( 9 + 9 ) / 8 ) )
5 [27618]: ( ( 9 / 9 ) + ( 9 - 5 ) )
6 [31741]: ( ( 9 * ( 9 - 9 ) ) + 6 )
7 [26727]: ( 9 - ( ( 9 + 9 ) / 9 ) )
8 [29854]: ( ( ( 9 * 9 ) - 9 ) / 9 )
9 [27736]: ( ( 9 * ( 9 - 9 ) ) + 9 )

neizod

#!/usr/bin/env python3


size = (1000,1000)
polygon = [ (612,661), (668,661), (668,612), (752,757), (668,757), (668,950),
            (312,334), (284,383), (326,407), (159,407), (201,334), ( 33,238),
            (745,238), (717,189), (675,213), (759, 68), (801,141), (968, 44), ]
guards = polygon[4::6]

neizod

neizod

#!/usr/bin/env python3

from random import randrange, shuffle, choice
from collections import Counter


class Judge(object):
    def __init__(self):
        self.doors = ['goat', 'goat', 'CAR']
        shuffle(self.doors)                 # move the prize into a random door

neizod

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

const scene = new THREE.Scene();

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

import sys
from operator import iconcat
from functools import reduce

sys.setrecursionlimit(100010)


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

neizod

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

#!/usr/bin/env python3


# change params here

N = 3
M = 3
PRINT_UNIQUE_ANSWERS = True