iluxonchik

function get_User($url){
	/*****************************************************************
	* Retrieves the user from a paste 
	* -> This function is a bit hacky and doesn't have the best design
	******************************************************************/
	$str = file_get_contents($url);
	if(strlen($str) > 0){
		preg_match('/\<div class="paste_box_line2"\>(.*)\<\/div\>/', $str, $user);
		$pieces = explode(' ', $user[1]);
		if ($pieces[2]!='guest'){

iluxonchik

function binary_gcd($a, $b){
	/* computes and returns the greatest common divisor between a and b */
	
	/*
	 *	Binary GCD Algorithm, according to Wikipedia "binary GCD can be about 60% 
	 *	more efficient (in terms of the number of bit operations) on average than the Euclidean algorithm".

	 *	More about the Binary GCD Algorithm: http://en.wikipedia.org/wiki/Binary_GCD_algorithm
	 *	Java Implementation: http://introcs.cs.princeton.edu/java/23recursion/BinaryGCD.java.html
	 *  C++ Implementation: https://gist.github.com/cslarsen/1635213

iluxonchik

function gcd_recursive($a, $b){
	/* computes and returns the greatest common divisor between a and b */
	
	/*
	 *	Binary GCD Algorithm, according to Wikipedia "binary GCD can be about 60% 
	 *	more efficient (in terms of the number of bit operations) on average than the Euclidean algorithm".

	 *	More about the Binary GCD Algorithm: http://en.wikipedia.org/wiki/Binary_GCD_algorithm
	 *	Java Implementation: http://introcs.cs.princeton.edu/java/23recursion/BinaryGCD.java.html
	 *  C++ Implementation: https://gist.github.com/cslarsen/1635213

iluxonchik

function textToASCII($text){
	/* recieves a chunk of text and returns the number resulting from converting all of the caharacters to ASCII */
	$asciified = 0; // stores the "asciified" text
	for ($i = 0; $i<strlen($text); $i++){
		if (ord($text[$i]) < 10) 
			// if the character's ASCII code is less than 10, multiplay by 10, so that that integer can be "concatenated"
			$asciified *= 10;
		else if (ord($text[$i]) < 100)
			// if the character's ASCII code is less than 100, multiplay by 100, so that that integer can be "concatenated"
			$asciified *= 100;

iluxonchik

##Clues To Implement

• trioLeft(Peca, Linha, Coluna, Tabuleiro)
• trioRight(Peca, Linha, Coluna, Tabuleiro)
• cobra(Peca, Linha, Coluna, Tabuleiro)
• tSimples(Peca, Linha, Coluna, Tabuleiro)
• tLeft(Peca, Linha, Coluna, Tabuleiro)
• tRight(Peca, Linha, Coluna, Tabuleiro)
• tInvertido(Peca, Linha, Coluna, Tabuleiro)
• cantoTopLeft(Peca, Linha, Coluna, Tabuleiro)
• cantoTopRight(Peca, Linha, Coluna, Tabuleiro)

iluxonchik

	public AndGateTwo() { gateOne = gateTwo = false; }
	public AndGateTwo(boolean bool) { gateOne = gateTwo = bool; }
	public AndGateTwo(boolean gOneBool, boolean gTwoBool) { gateOne = gOneBool; gateTwo = gTwoBool; }

iluxonchik

#include "Animal.h"
#include <string>
#include<iostream>

Animal::Animal(int age, std::string name) : name(name), age(age) { }


Animal::~Animal() { }

void Animal::sleep(){ printf("Shhh! %s is sleeping...\n", this->name); }

iluxonchik

// Works
std::ostream &operator<<(std::ostream &o, const Cat cat){
	o << (Animal&)cat << " Weight: " << cat.weight();
	return o;
}

//Doesn't work
std::ostream &operator<<(std::ostream &o, const Cat cat){
	o << (Animal*)cat << " Weight: " << cat.weight();
	return o;

iluxonchik

#include "Animal.h"
#include <string>
#include<iostream>

Animal::Animal(int age, std::string name) : _name(name), _age(age) { }


Animal::~Animal() { }

void Animal::sleep(){ printf("Shhh! %s is sleeping...\n", this->name); }

iluxonchik

#include "Dog.h"
#include <iostream>
#include <string>

Dog::Dog(int age, std::string name, int weight) : Animal(age, name), _weight(weight) {}

Dog::~Dog() {};

void Dog::bark()
{ std::cout << ((Animal*)this)->name() + " says: \"ruff, ruff!\"" << std::endl; }