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

#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

1
2
3
4
5
6
7
8
9
10

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

#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

#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>
#include <string.h>

#define LOW_PRIME_COUNT 6542

int main()
{
	puts("2\n3");

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

package midpcalc;



/**
 * <b>Java integer implementation of 63-bit precision floating point.</b>
 * <br><i>Version 1.13</i>