Ayrx

def is_equal(a, b):
    if len(a) != len(b):
        return False

    result = 0
    for x, y in zip(a, b):
        result |= x ^ y
    return result == 0

Ayrx

def enum(**enums):
    return type('Enum', (), enums)

Ayrx

import os

def get_case_sensitive_pathname(path, top):
    for root, dirs, files in os.walk(top):
      for d in dirs:
          if os.path.join(root, d).lower() == path.lower():
              return os.path.join(root, d)
      for f in files:
          if os.path.join(root, f).lower() == path.lower():
              return os.path.join(root, f)

Ayrx

#include <stdlib.h>
#include <stdio.h>

int main(int argc, char *argv[]) {
    char *addr;
    if (argc < 2) {
        printf("Usage:\n%s <environment variable name>\n", argv[0]);
        exit(0);
    }

Ayrx

public static int safeLongToInt(long l) {
    if (l < Integer.MIN_VALUE || l > Integer.MAX_VALUE) {
        throw new IllegalArgumentException
            (l + " cannot be cast to int without changing its value.");
    }
    return (int) l;
}

Ayrx

import os

for r,d,f in os.walk("/var/www"):
    for files in f:
        if files.endswith(".php"):
            print "You are fucked!"

Ayrx

def pythagorean_triplets(n):
    for i in xrange(1, n):
        j = i+1
        k = j+1

        while k <= n:
            while k*k < (i*i) + (j*j):
                k += 1

            if k*k == (i*i) + (j*j) and k <= n:

Ayrx

def lcm(*numbers):
    """Return lowest common multiple."""    
    def lcm(a, b):
        return (a * b) // gcd(a, b)
    return reduce(lcm, numbers, 1)

Ayrx

def prime_factors(n):
    """Returns all the prime factors of a positive integer"""
    factors = []
    d = 2
    while n > 1:
        while n % d == 0:
            factors.append(d)
            n /= d
        d += 1
        if d*d > n:

Ayrx

def factors(n):
    return set(reduce(list.__add__,
                      ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0)))