macroxela

############################################################################
#Find how many ways you can make change with coins c = [c1, c2, ..., cm]
#for change N. Similar to the Subset Sum problem
#
############################################################################

#Dynamic Programming Solution
def cchange(Cents, coins):
    #Initialize matrix to store values
    matrix = [[0 for i in range(0, cents+1)] for j in range(0, len(coins)+1)]

macroxela

#########################################################################
# Finds all permutations of a given string by using a tree-structure    #
# It sets two counters, i and j with 0 < i <= j < length(string)        #
# While keeping i fixed, iterates j through the remaining characters,   #
# swapping each one with the character at i and adding it to a list     #
# if the new string isn't on the list. Example shown below for 'abc'    #
#                                                                       #
#                                   (abc)                               #
#                                |    |   |                             #
#                            |        |      |                          #

macroxela

##########################################################################################################
#  Balanced Brackets Verifier                                                                            #
# • For the balanced parentheses problem, checks if any kind of brackets are balanced                    #
#   Brackets can be mixed including () [] and {}                                                         #
# • Creates random sequences of brackets                                                                 #
#                                                                                                        #
# Alex Marroquin                                                                                         #
# 29 April 2020                                                                                          #
#                                                                                                        #
#############################################################

macroxela

#ifndef _PARSER_H
#define _PARSER_H

#include <string>

using namespace std;

void cutstring(string &input, int pos)
{
        string dummy = "";

macroxela

<?php
#
# Portable PHP password hashing framework.
#
# Version 0.3 / genuine.
#
# Written by Solar Designer <solar at openwall.com> in 2004-2006 and placed in
# the public domain.  Revised in subsequent years, still public domain.
#
# There's absolutely no warranty.

macroxela

#ifndef _MATRIX
#define _MATRIX

/*
Matrix Header File

Matrix library that allows creation, addition,
subtraction, and multiplication of matrices.
2 Dimensional matrices only

macroxela

/**********************************************
Knapsack Problem
Alex Marroquin
12 March 2014

Given a sequence of problems and maximum weight
the objective is to find the collection of 
items which will add up to the highest value
while remaining under the weight limit.
**********************************************/

macroxela

/*
 Code From DaniWeb
 http://www.daniweb.com/software-development/java/threads/162294/clock.java
 */
 

import java.util.*;
import java.text.*;
public class Clock
{

macroxela

import java.util.*;

public class Combatant {

	double hp, attack, defense, speed;
	String name, type, attribute;
	Random ran = new Random();
	Combatant()
	{
		name = "None";

macroxela

import java.awt.*;
import javax.swing.*;

//A single cell in the game world

public class Cell
{
	//walkable true means your a path, false means you're a wall
	boolean  walkable, marked, path;
	int weight, distance;