beyondlimits

#!/usr/bin/env python3
#-*- coding: utf-8 -*-

from __future__ import print_function

def binomial(n, k):

	if n < 0 or k < 0 or k > n:
		return 0

beyondlimits

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

#define LOG_2 0x02000000
#define LOG_3 0x032B8034
#define LOG_5 0x04A4D3C2
#define LOG_7 0x059D5D9F
#define LOG_LIMIT 0x80000000
#define COUNT 85348

beyondlimits

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

#define LOG_2 0x02000000
#define LOG_3 0x032B8034
#define LOG_5 0x04A4D3C2
#define LOG_7 0x059D5D9F
#define LOG_LIMIT 0x80000000

int main()

beyondlimits

for a in {0..64}
do
	for b in {0..40}
	do
		for c in {0..28}
		do
			for d in {0..25}
			do
				dc -e "[p]sp 2 $a ^ 3 $b ^ * 5 $c ^ * 7 $d ^ * d 2 64 ^ >p"
			done

beyondlimits

1
2
3
4
5
6
7
8
9
10

beyondlimits

memory_limit = 1G
error_reporting = E_ALL
display_errors = stderr
display_startup_errors = On
auto_prepend_file = strict-error-handling.php
include_path = "/usr/share/php"
sqlite3.defensive = 1
zend.assertions = 1
assert.active = On
assert.exception = On

beyondlimits

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

static unsigned short lookup_table[512];

unsigned short mul(unsigned char a, unsigned char b)
{
	unsigned short x = a + b, y = (a > b) ? (a - b) : (b - a);
	return lookup_table[x] - lookup_table[y];

beyondlimits

import bpy

empty = bpy.data.objects['Empty']
probe = empty.constraints['Probe']
output = bpy.data.texts['Output']

output.clear()

for i in range(0, 101):
	t = i / 100

beyondlimits

{
	"manifest_version": 2,
	"name": "My New Extension",
	"version": "1.0",
	"background": {
		"scripts": ["script.js"]
	},
	"permissions": [
		"downloads",
		"tabs",

beyondlimits

var arr = 'abcdefghijklmnopqrstivwxyz'.split('');
var start = 0;
var end = arr.length - 1;
var swaps = 0;

while (start < end) {
  for (var i = start; i < end; i += 2) {
    var tmp = arr[i];
    arr[i] = arr[i + 1];
    arr[i + 1] = tmp;