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

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

Quicksort

Since Blockly doesn't accept function's argument & every variables is global. So I made a recursive stack just for this.

See the picture or copy this xml code and paste into XML tab in this page to see live demo yourself.

May the code be with you. :3

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

neizod

            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
                    Version 2, December 2004

 Copyright (C) 2011 Nattawut Phetmak <http://about.me/neizod>

 Everyone is permitted to copy and distribute verbatim or modified
 copies of this license document, and changing it is allowed as long
 as the name is changed.

            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE

neizod

neizod

neizod

#include <iostream>
using namespace std;


bool is_int(string number) {
    bool after_dot = false;
    for (char c : number) {
        if (after_dot and c != '0') {
            return false;
        } else if (c == '.') {