orendon

import sys, re

def main():
    curr_path = '/Users/orendon/dev/codez/advent-of-code/2023/'
    # lines = open(curr_path + 'input.txt', 'r').readlines()
    lines = sys.stdin.readlines()
    
    navigation = lines[0].strip()
    network = {}
    starting_nodes = []

orendon

[USVISA]
; Account and current appointment info from https://ais.usvisa-info.com
USERNAME = YOUR_EMAIL
PASSWORD = YOUR_PASSWORD
SCHEDULE_ID = YOUR_ID
MY_SCHEDULE_DATE = YYYY-MM-DD
; Spanish - Colombia
COUNTRY_CODE = es-co
; Bogotá
FACILITY_ID = 26

orendon

// Video con explicación https://youtu.be/GEoUPRYguY4

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

struct TrieNode {
    char val;
    bool end;

orendon

Fenwick Tree (Binary Indexed Tree)

• https://jamboard.google.com/d/13V-Haxvp1OsPOxmYaQe7ZMj8Oor5lD07fDZCMT8jnXw/viewer?f=10

orendon

# edit to current date
GIT_COMMITTER_DATE="$(date)" git commit --amend --no-edit --date "$(date)"

# edit to arbitrary date
GIT_COMMITTER_DATE="Fri Aug 13 18:00:00 2021 -0500" git commit --amend --no-edit --date "Fri Aug 13 18:00:00 2021 -0500"

orendon

history | awk '{print $2}' | sort | uniq -c | sort -nr | head -20

orendon

Recursos de las sesiones del mes de Febrero (Grafos)

Todo el mes de febrero estaremos tratando sobre grafos, a continuación los recursos de cada una de las sesiones

• Ene 26 - Introducción a Grafos y Representación
• Feb 02 - BFS (Breadth First Search)
• Feb 09 - Flood-fill y DFS (Depth First Search)
• Feb 16 - Ordenamiento Topológico
• Feb 23 - Kosaraju

Las grabaciones quedan https://www.youtube.com/playlist?list=PLRMfC7A6yJWqJ6x-Xw4Fmrpx-4N5wPjQH

orendon

# /etc/systemd/system/tle.service

[Unit]
Description=TLE-bot

[Service]
ExecStart=/home/orendon/TLE/run.sh
Restart=on-failure
RestartSec=5s

orendon

#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include "tmpl.h"

using namespace std;

int bs_part1(int, int);

orendon

#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>

using namespace std;

#define forn(i, j, n) for (int i = j; i < (int)n; i++)
#define forr(i, j, n) for (int i = j; i >= (int)n; i--)
#define fore(i, coll) for (auto i : coll)