tron1point0

import Data.List
import Data.Maybe
import Data.Monoid

-- The hard stuff

solve' :: Int -> [(Int, Int)] -> [(Int, Int)] -> Solutions
solve' nq queens board
    | length queens == nq = Solutions [Solution nq queens]
    | length board == 0   = mempty

tron1point0

#!/usr/bin/env perl

use v5.14;
use warnings;

use LWP::UserAgent;
use List::MoreUtils qw(part);
use YAML qw(LoadFile);
use JSON::XS qw(decode_json);
use Text::FormatTable;

tron1point0

#!/usr/bin/env perl

use v5.14;
use warnings;

package Handler::Send;
use base 'Tatsumaki::Handler';

sub post {
    my ($self,$id) = @_;

tron1point0

#!/usr/bin/env perl

use v5.14;
use warnings;
use YAML::XS qw(Load);

my @files = qw(config.yml environments/development.yml);
unshift @files, @ARGV if @ARGV;

for (@files) {

tron1point0

#ifdef STANDARD
#include <string.h>
#include <stdlib.h>
#include <time.h>
#else
#include <my_global.h>
#include <my_sys.h>
#endif
#include <mysql.h>
#include <m_ctype.h>

tron1point0

pascal' :: [Int] -> [Int]
pascal' l
    | length l < 2 = [1]
    | otherwise = (a + b) : (pascal' (b:rest))
    where a:(b:rest) = l

pascal :: [Int] -> [Int]
pascal = (1:) . pascal'

tron1point0

npto :: (Integral a) => a -> [a]
npto x = [2,3] ++ concat [[x*6-1,x*6+1] | x <- [1..n]]
    where n = ((+1) . round . sqrt . fromIntegral $ x) `div` 6

factors :: (Integral a) => a -> [a]
factors 1 = []
factors x = least : factors (x `div` least)
    where least = head $ fs ++ [x]
          fs = filter ((==0) . mod x) . npto $ x

tron1point0

package Magento;

use v5.14;
use warnings;
use Carp;
use XML::RPC;

sub new {
    my ($class,$uri,$user,$pass) = @_;
    my $client = XML::RPC->new("$uri/api/xmlrpc/");

tron1point0

VERSION := 4.1.0
ZIPFILE := ext-$(VERSION)-gpl.zip

download := http://cdn.sencha.io/$(ZIPFILE)
downloader := $(shell which curl)
downloader ?= $(shell which wget)

COFFEE := $(shell which coffee)
UNZIP := $(shell which unzip)

tron1point0

#include <stdlib.h>

#define lc(var) (var >= 'A' && var <= 'Z' ? var + 32 : var)
#define uc(var) (var >= 'a' && var <= 'z' ? var - 32 : var)
#define vowelp(var) ( \
    uc(var) == 'A' || \
    uc(var) == 'E' || \
    uc(var) == 'I' || \
    uc(var) == 'O' || \
    uc(var) == 'U')