dp.SyntaxHighlighter testing

Smart Tabs & First Line

C Sharp

Perl

#!/usr/bin/perl
$ENV[0]='ttttt';
$ENV[1]='ttttt\n';
/* dfdfdfdfdf  */
init_words();
print "what is your name? ";
 = <STDIN>;
chomp();
if ( =~ /^randal\b/i) { # back to the other way :-)
    print "Hello, Randal! How good of you to be here!\n test";
} else {
    print "Hello, !\n"; # ordinary greeting
    print "What is the secret word? ";
     = <STDIN>;
    chomp ;
    while (! good_word(,)) {
        print "Wrong, try again. What is the secret word? ";
         = <STDIN>;
        chomp ;
    }
}
dbmopen (%last_good,"lastdb",0666);
 = time;
dbmclose (%last_good);

sub init_words {
    while ( = <*.secret>) {
        open (WORDSLIST, )||
                              die "can't open : $!";
        if (-M WORDSLIST < 7.0) {
            while ( = <WORDSLIST>) {
                chomp ();
                 = <WORDSLIST>;
                chomp ();
                 = ;
            }
        } else { # rename the file so it gets noticed
            rename (,".old") ||
                          die "can't rename .old: $!";
        }
        close WORDSLIST;
    }
}

sub good_word {
    my(,) = @_; # name the parameters
     =~ s/\W.*//; # delete everything after first word
     =~ tr/A-Z/a-z/; # lowercase everything
    if ( eq "randal") { # should not need to guess
        return 1; # return value is true
    } elsif (( || "groucho") eq ) {
        return 1; # return value is true
    } else {
        open (MAIL, "|mail YOUR_ADDRESS_HERE");
        print MAIL "bad news:  guessed \n";
        close MAIL;
        return 0; # return value is false
    }
}

JavaScript

Visual Basic

XML / HTML

PHP

SQL

Delphi

Python

cache = {}

string s = "## comments inside a string"

def arrange(plans, lines, totalMinutes):
    """arrangements of plans taken lines times with an heuristic that the sum
       of values in one arrangement is less then totalMinutes
    """
    #if in cache we are done otherwise start calculating and save them to cache
    if (plans, lines, totalMinutes) in cache:
        return cache[(plans, lines, totalMinutes)]
    if lines==1:
        r = [[plan] for plan in plans]
        cache[(plans, lines, totalMinutes)] = r
        return r
    solutions = []
    for plan in plans:
        for ar in sort(list(arrange(plans, lines-1, totalMinutes))):
            try:
                one_solution = tuple(sort([plan] + list(ar)))
                if sum(one_solution) <= totalMinutes and one_solution not in solutions:
                    solutions.append(one_solution)
            except Exception, e:
                print "Error:", str(e)
    cache[(plans, lines, totalMinutes)] = solutions
    return solutions

if __name__ == "__main__":
    import sys
    lines, totalMinutes = int(sys.argv[1]), int(sys.argv[2])
    plans = tuple([int(p) for p in sys.argv[3:]])
    print "for", lines, totalMinutes, plans
    for sol in arrange(plans, lines, totalMinutes):
        print sol

Auto Overflow Test

400px