Byron Pérez byron-perez
byron-perez
/ gist:ff167099c10f54af90a8416a3d29d230
Created
June 12, 2017 03:50
Página de Presentación
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!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; } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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"); | |
| } |
byron-perez
/ gist:6226aeed94b5740318e44a6585ce4670
Created
June 21, 2017 17:18
ejercicios 21/06/2017
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <script> | |
| function factorialIter(n){ | |
| var a = 1; | |
| var x = parseInt(n); | |
| for(m = x; m > 0; m--) | |
| { | |
| a = a * m; | |
| } |
byron-perez
/ gist:345fd78c4881e7160950dcc2f85db97c
Created
June 23, 2017 05:03
version recursiva de algoritmos
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <script> | |
| function factorialRecursivo(n){ | |
| var x = parseInt(n); | |
| if(x == 0) return 1; | |
| return x * factorialRecursivo(x - 1); | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!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"> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/bin/python3 | |
| import sys | |
| #functions | |
| def BFS(G, s): | |
| explored = [] | |
| queue = [s] |
byron-perez
/ unoptimal.py
Last active
August 31, 2017 21:50
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/bin/python3 | |
| import sys | |
| #functions | |
| def bsearch(x, L): | |
| if x == L[len(L) // 2]: | |
| return True | |
| if (len(L) // 2) == 0: | |
| return False |
byron-perez
/ try the trie
Last active
October 19, 2017 22:01
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <map> | |
| #include <set> | |
| #include <list> | |
| #include <cmath> | |
| #include <ctime> | |
| #include <deque> | |
| #include <queue> | |
| #include <stack> | |
| #include <string> | |
| #include <bitset> |
byron-perez
/ 4and7
Created
November 16, 2017 02:28
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #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; |
OlderNewer