douglas-vaz

#include "linux_io.h"

#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
#include <wchar.h>

int main(void)
{

douglas-vaz

#!/bin/sh
#Add pkg-config support to GMP
#http://gmplib.org/list-archives/gmp-discuss/2013-May/005329.html

echo "Creating gmp.pc.in..."

echo """prefix=@prefix@
exec_prefix=@exec_prefix@
libdir=@libdir@
includedir=@includedir@

douglas-vaz

prefix=@prefix@
exec_prefix=@exec_prefix@
libdir=@libdir@
includedir=@includedir@

Name: gmp 
Description: GNU Multiple Precision Arithmetic Library
URL: http://gmplib.org
Version: @PACKAGE_VERSION@
Libs: -L${libdir} -lgmp

douglas-vaz

/**
-#Copyright (c) 2013 Douglas Vaz, Sharvari Bhosale
-#
-#Permission is hereby granted, free of charge, to any person obtaining a copy
-#of this software and associated documentation files (the "Software"), to deal
-#in the Software without restriction, including without limitation the rights
-#to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-#copies of the Software, and to permit persons to whom the Software is
-#furnished to do so, subject to the following conditions:
-#

douglas-vaz

from pybrain.structure import RecurrentNetwork, FullConnection, LinearLayer, SigmoidLayer
from pybrain.datasets import SupervisedDataSet
from pybrain.supervised.trainers import BackpropTrainer


#Define network structure
network = RecurrentNetwork(name="XOR")

inputLayer = LinearLayer(2, name="Input")
hiddenLayer = SigmoidLayer(3, name="Hidden")

douglas-vaz

/**
 * Boyer-Moore string pattern matching
 * 
 * @author Douglas 
 */
import java.util.Map;
import java.util.HashMap;

public class BoyerMoore

douglas-vaz

#include <iostream>

using namespace std;

enum players {X = 1, O = 2};

class TicTacToe{
  short state[9] = {0, 0, 0, 0, 0, 0, 0, 0, 0};

  const short strategy[9] =  { 1, 3, 1, 3, 5, 3, 1, 3, 1};

douglas-vaz

/**
 * Based on the paper "A Heuristic for Solving the Generalized Water Jug Problem 
 * Florin Leon, Mihai Zaharia, Dan Galea
 */

#include <iostream>

using namespace std;

class Jug{

douglas-vaz

#!/usr/bin/python3
def whazaa(n):
    for i in range(1,n):
        if i % 15 == 0:
            print('Whazaa')
        elif i % 3 == 0:
            print('Hip')
        elif i % 5 == 0:
            print('Hop')
        else:

douglas-vaz

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

class Node{