Skip to content

Instantly share code, notes, and snippets.

@Said210
Said210 / matrixMut.html
Created June 15, 2021 17:50
chain matrix multiplication algorithm using dynamic programming.
<!DOCTYPE html>
<html>
<head>
<title>Multiplicación de matrices.</title>
<meta charset="UTF-8" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<link href="https://unpkg.com/tailwindcss@^2/dist/tailwind.min.css" rel="stylesheet" type="text/css" />
<link rel="stylesheet" href="https://pro.fontawesome.com/releases/v5.10.0/css/all.css" integrity="sha384-AYmEC3Yw5cVb3ZcuHtOA93w35dYTsvhLPVnYs9eStHfGJvOvKxVfELGroGkvsg+p" crossorigin="anonymous"/>
<style type="text/css">
body{background-color: #F9FAFB;}
@Said210
Said210 / cambio.js
Last active June 12, 2021 17:14
Implementación de un algoritmo voraz / avido en JS para el problema de dar cambio.
// DATASET EXAMPLE.
let coins_sorted = [
{value: 500, amount: 4},
{value: 200, amount: 0},
{value: 100, amount: 1},
{value: 50, amount: 0},
{value: 20, amount: 5},
{value: 10, amount: 3},
{value: 5, amount: 2},
{value: 2, amount: 5},
@Said210
Said210 / amazon.js
Created August 26, 2020 17:35
Filter amazon best prices [SELLER CENTRAL]
/*
Use in https://sellercentral.amazon.com.mx/inventory/ref=xx_invmgr_dnav_xx?tbla_myitable=sort:%7B%22sortOrder%22%3A%22DESCENDING%22%2C%22sortedColumnId%22%3A%22date%22%7D;search:;pagination:1;
*/
trs = document.getElementsByClassName("mt-row")
for (var i = 0; i < trs.length; i++) {
if (trs[i].innerHTML.indexOf("aui-check") == -1) {
@Said210
Said210 / OOM.php
Created September 26, 2016 13:56
OOM LAST
<?php
/*
Build by eulr @ eulr.mx
hola@eulr.mx
V 0.6b
*/
require_once 'connection.php';
require_once 'logger.php';
class OOM{
/*
* GET FREE INDIE MUSIC WITH EMERGENTE FM
* TRY emergente.play(572)
*/
var emergente = {
template: "http://admin.emergente.fm/uploads/song/%/mp3_high.mp3",
set: function(i){
return emergente.template.replace("%",i);
/*
* GO GIVE <3 TO A COUPLE HELLOTAB POSTS
* where
* i = Initial value, 100 most of the times
* g = Goal value, (999?)
* post = HelloTab post token
*/
function like_post(i, g, post){
if (i < g) {
@Spec Heap
Un árbol heap es un árbol binario completo que tiene
un orden impuesto en sus nodos tal que el valor de la raiz
del árbol es mayor o igual que los valores en ambos sub-árboles,
y ambos sub-árboles son a su vez árboles heap.
***Glosario:***