neizod

from itertools import cycle, izip

k, l, m, n, d = [int(raw_input()) for _ in range(5)]
dragons = [cycle([False] * (i-1) + [True]) for i in {k, l, m, n}]

print sum(any(next(izip(*dragons))) for _ in xrange(d))

neizod

1
2
3
11
22
101
111
121
202
212

neizod

def sqrt(n): 
    if n == 0:
        return 0 
    a, b = divmod(n.bit_length(), 2)
    x = 2 ** (a + b)
    while True:
        y = x + n // x
        y //= 2
        if y >= x:
            return x

neizod

type Vector = (Double, Double)


dotV :: Vector -> Vector -> Double
dotV (x, y) (u, v) = x * u + y * v


addV :: Vector -> Vector -> Vector
addV (x, y) (u, v) = (x + u, y + v)

neizod

<h3>encrypted sentence</h3>
<script src="http://code.jquery.com/jquery-2.1.0.min.js"></script>

<input name="text" size="40" />
<button id="mk">make</button>

<hr />
<h3>decrypted sentence</h3>
<div id="box"></div>
<hr />

neizod

#include <iostream>
using namespace std;

int arr[] = {2,5,3,9,1,0,7,4,8,6};

void show(int i=-1) {
    for (int k=0; k<10; k++) {
        if (i-1 == k) cout << "\x1b[37;1m";
        if (i == k) cout << "\x1b[31;1m";
        cout << arr[k];

neizod

#!/usr/bin/env python3

import sys
from itertools import count


class Point(object):
    def __init__(self, pp):
        self.x, self.y = pp

neizod

#!/usr/bin/env python3

from numpy import matrix, zeros


class RandomWalk(object):

    limpow = 10**9
    offset = [(0,-1), (0,1), (-1,0), (1,0)]

neizod

neizod

Keybase proof

I hereby claim:

• I am neizod on github.
• I am neizod (https://keybase.io/neizod) on keybase.
• I have a public key whose fingerprint is 48AB A6A9 A002 DCD8 6E24 DFB0 0E27 2831 8C9B 4947

To claim this, I am signing this object: