The Code

Euler.c

#include <stdio.h>

int isDivisible(int num) {
	for(int i = 20; i >= 1; i--)
		if(num % i != 0)
			return 0;
	return 1;
}

int main() {
	int i = 1;
	while(1) {
		if(isDivisible(i)) {
			printf("%d\n", i);
			break;
		}
		i++;
	}
	return 0;
}

Euler.java

class Euler {
	
	public static boolean isDivisible(int num) {
		for(int i = 20; i >= 1; i--)
			if(num % i != 0)
				return false;
		return true;
	}

	public static void main(String[]args) {
		int i = 1;
		while(true) {
			if(isDivisible(i)) {
				System.out.println(i);
				break;
			}
			i++;
		}
	}
	
}

Euler.py

def isDivisible(num):
	for i in range(20, 1, -1):
		if num % i != 0:
			return False
	return True

i = 1

while(True):
	if(isDivisible(i)):
		print(i)
		break
	i += 1