Finomnis

This is how our current reduce algorithm works.

A A A A A A A A

split:
A A A A   A A A A

accumulate:
           A  A  A  A
initial B->+->+->+->+->B 

Finomnis

#!/usr/bin/env python3
import math
import time


def isPrime(n):
    max_divisor = math.floor(math.sqrt(n))
    for d in range(2, max_divisor+1):
        if n % d == 0:
            return False

Finomnis

===== 3-gon =====
    10 (3, 4)
    120 (8, 15)
    1540 (20, 55)
    7140 (34, 119)

===== 4-gon =====
    4900 (24, 70)

Finomnis

public class Test {
	
	private static class A{
		public static void test(){
			System.out.println("A:test");
		}
		
		void dynamic(){
			System.out.println("A:dynamic");
		}