[Perl] Project Euler

#! /usr/bin/perl -w
use strict;

my %hash = ();

LAB_0: foreach my $b ( 1..9999 ) {
	LAB_1: foreach my $a ( 0..999 ) {
		my $count = -1;
		foreach my $n ( 0..999 ) {
			my $plus = $n ** 2 - $a * $n + $b;
			next LAB_0 if $plus < 1;
			$count++;
			next LAB_1 if is_prime_number( $plus ) == 0;
			$hash{$count} = [ $a, $b ];
		}
	}
}

my $key = 0;
foreach my $k ( sort( { $a <=> $b } keys %hash ) ) {
	$key = $k;
}
print "0  -  ", $key, "       |a| = ", ${$hash{$key}}[0], "   |b| = ", ${$hash{$key}}[1], "\n";

sub is_prime_number {
	return 0 if ( int( $_[0] ) != $_[0]);
	foreach my $divider ( 2..sqrt(  $_[0] ) ) {
		my $quotient = $_[0] % $divider;
		return 0 if ( $quotient == 0 );
	}
	return 1;
}

#!/usr/bin/env python
#-*- coding: iso-8859-1 -*-

from math import sqrt

def isprime(n):

    if n % 2 == 0 and not n == 2:

        return 0

    else:

        limit = int(sqrt(n)) + 1

        for l in range(3, limit, 2):

            if n % l == 0:
                return 0

        return 1

vals = [0, 0, 0]

print
print "Calculating:"
print "n\ta\tb"

for a in range(-999, 1000, 1):

    for b in range(-999, 1000, 1):

        for n in range(100):

            x = n ** 2 + a * n + b

            if x < 0 or not isprime(x):

                if n > vals[0]:

                    vals = [n, a, b]
                    print str(n) + "\t" + str(a) + "\t" + str(b)

                break

print "\nResult:"
print "n\ta\tb"
print str(vals[0]) + "\t" + str(vals[1]) + "\t" + str(vals[2]) + "\n"

#include <stdio.h>
#include <math.h>

/* nr27.c */

int isprime(int n);

int main(void)
{
    int n;
    int a;
    int b;
    int x;

    int vals[] = { 0, 0, 0 };

    printf("\nCalculating:\nn\ta\tb\n");

    for(a = -999; a <= 999; a++)
    {
        for(b = -999; b <= 999; b++)
        {
            n = 0;
            x = pow(n, 2) + a * n + b;

            while(isprime(x))
            {
                n++;
                x = pow(n, 2) + a * n + b;
            }

            if(n > vals[0])
            {
                vals[0] = n;
                vals[1] = a;
                vals[2] = b;

                printf("%d\t%d\t%d\n", n, a, b);
            }
        }
    }

    printf("\nResult:\nn\ta\tb\n");
    printf("%d\t%d\t%d\n\n", vals[0], vals[1], vals[2]);

    return 0;
}


int isprime(int n)
{
    int l;
    int limit;

    if(n < 0)
    {
        return 0;
    }

    if(n % 2 == 0 && n != 2)
    {
        return 0;
    }
    else
    {
        limit = (int) sqrt(n) + 1;

        for(l = 3; l < limit; l += 2)
        {
            if(n % l == 0)
            {
                return 0;
            }
        }

        return 1;
    }
}

gcc -Wall -W -ansi -pedantic -o nr27 nr27.c -lm
./nr27

if($n == 1)
{
    return 0;
}