Byron Pérez byron-perez

## gist:ff167099c10f54af90a8416a3d29d230
<!DOCTYPE html>
<html>
<head>
<title>Bio</title>

<STYLE>
  H1 { font-size: 400%; margin-bottom: 0ex; margin-top: 1.5ex; padding-left: 0.21em;
       color: #440099; text-align: center; }
  /*border-bottom: thick solid #6600cc; }*/
  TH { text-align: left; vertical-align: top; padding-right: 1em; }

## gist:0f1e9364780ba15314b55bd6e7edf727
for(i = 1; i <= 100; i++){
	if((i%3 == 0) && (i%5 != 0)){
  	console.log("Benito");
  }
  else if((i%5 == 0) && (i%3 != 0)){
  	console.log("Campeon");
  }
  else if((i%5 == 0) && (i%3 == 0)){
  	console.log("Benito Campeon");
  }

## gist:6226aeed94b5740318e44a6585ce4670
<script>

function factorialIter(n){
	var a = 1;
	var x = parseInt(n);

	for(m = x; m > 0; m--)
	{
		a = a * m;
	}

## gist:345fd78c4881e7160950dcc2f85db97c
<script>


function factorialRecursivo(n){
	var x = parseInt(n);
	if(x == 0) return 1;
	return x * factorialRecursivo(x - 1);

}

## ejer.html
<!DOCTYPE html>
<html>
<head>
	<title>	ejercicio</title>
</head>
<body>
<span id="stars">
	<img id="1" src="hola/chistosas.jpg" onclick="cambiar();">
 	<img src="hola/chistosas.jpg">
	<img src="hola/chistosas.jpg">

## dom_ejerc.js
nextNode = function(node) {

  //...Code goes here to walk to the next node...
  if(node.childNodes.length != 0)
  {
    return node.firstChild;
  }
  else if(node.childNodes.length == 0 && node.nextSibling != null)
  {
	return node.nextSibling;

## gist:067a9087df4cf1ba9fc3c4d188c923da
#!/bin/python3

import sys


#functions
def BFS(G, s):

    explored = []
    queue = [s]

## unoptimal.py
#!/bin/python3

import sys

#functions
def bsearch(x, L):
    if x == L[len(L) // 2]:
        return True
    if (len(L) // 2) == 0:
        return False

## try the trie
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>

## 4and7
#include <bits/stdc++.h>

using namespace std;

int numDigits(int number)
{
    int digits = 0;
    if (number < 0) digits = 1; // remove this line if '-' counts as a digit
    while (number) {
        number /= 10;
	<!DOCTYPE html>
	<html>
	<head>
	<title>Bio</title>

	<STYLE>
	H1 { font-size: 400%; margin-bottom: 0ex; margin-top: 1.5ex; padding-left: 0.21em;
	color: #440099; text-align: center; }
	/border-bottom: thick solid #6600cc; }/
	TH { text-align: left; vertical-align: top; padding-right: 1em; }
	for(i = 1; i <= 100; i++){
	if((i%3 == 0) && (i%5 != 0)){
	console.log("Benito");
	}
	else if((i%5 == 0) && (i%3 != 0)){
	console.log("Campeon");
	}
	else if((i%5 == 0) && (i%3 == 0)){
	console.log("Benito Campeon");
	}
	<script>

	function factorialIter(n){
	var a = 1;
	var x = parseInt(n);

	for(m = x; m > 0; m--)
	{
	a = a * m;
	}
	<script>


	function factorialRecursivo(n){
	var x = parseInt(n);
	if(x == 0) return 1;
	return x * factorialRecursivo(x - 1);

	}
	nextNode = function(node) {

	//...Code goes here to walk to the next node...
	if(node.childNodes.length != 0)
	{
	return node.firstChild;
	}
	else if(node.childNodes.length == 0 && node.nextSibling != null)
	{
	return node.nextSibling;
	#!/bin/python3

	import sys


	#functions
	def BFS(G, s):

	explored = []
	queue = [s]
	#include <map>
	#include <set>
	#include <list>
	#include <cmath>
	#include <ctime>
	#include <deque>
	#include <queue>
	#include <stack>
	#include <string>
	#include <bitset>
	#include <bits/stdc++.h>

	using namespace std;

	int numDigits(int number)
	{
	int digits = 0;
	if (number < 0) digits = 1; // remove this line if '-' counts as a digit
	while (number) {
	number /= 10;