Skip to content

Instantly share code, notes, and snippets.

Having (YET another) kidney stone surgery in a few days...

Rogério Brito rbrito

Having (YET another) kidney stone surgery in a few days...
View GitHub Profile
rbrito /
Created Dec 7, 2018 — forked from Iunius118/
Auto save plug-in for GIMP [2.8, 2.9]
#!/usr/bin/env python
# Original (by yahvuu):
import tempfile, os
from time import *
from gimpfu import *
def autosave(image, layer):
backupInterval = 10 * 60
rbrito / gist:8e17e6bbc93bc2999d92b979d080c9c3
Created Jul 7, 2020 — forked from bazub/gist:3877971
Grayscale/Binary images using PIL
View gist:8e17e6bbc93bc2999d92b979d080c9c3"1.jpg")
threshold = 100
im = im2.point(lambda p: p > threshold and 255)"d.jpg")
result = tesseract.ProcessPagesWrapper(img,api)
rbrito / mathology.html
Created Mar 30, 2020 — forked from rosinality/mathology.html
Very simple latex sketchpad
View mathology.html
<!DOCTYPE html>
<html lang="en">
<meta charset="UTF-8">
body {
font-family: Arial, Helvetica, sans-serif;
rbrito / galois.c
Created May 23, 2019 — forked from meagtan/galois.c
Quick implementation of Galois fields
View galois.c
* The following is an implementation of the finite field GF(2^8) as bit vectors of length 8, where the nth bit represents the
* coefficient of the nth power of the generator in each element, and the generator satisfies the minimal polynomial
* x^8 + x^4 + x ^3 + x^2 + 1 in the prime field Z_2, in which addition is equivalent to XOR and multiplication to AND.
* The elements of GF(2^8) thus represent polynomials of degree < 8 in the generator x. Addition in this field is simply
* bitwise XOR, but multiplication requires the elimination of powers of x <= 8.
#include <stdio.h>
#include <stdint.h>
rbrito /
Created Jul 20, 2018 — forked from agentcooper/
Telegram chat backup/export

How to use

  1. Login to
  2. Copy-paste contents of telegram-scripts.js into JS console
  3. Run showContacts() to get the list of contacts with ids
  4. Run saveChat(userId) where userId is the id from step 3

Process can take a while, check console for progress. Occasionall FLOOD_WAIT errors are expected. Once done, browser will download the JSON file.


rbrito / spectre.c
Created Jan 5, 2018 — forked from ErikAugust/spectre.c
Spectre example code
View spectre.c
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#ifdef _MSC_VER
#include <intrin.h> /* for rdtscp and clflush */
#pragma optimize("gt",on)
#include <x86intrin.h> /* for rdtscp and clflush */
rbrito / remove-duplicate-subs
Created Jun 24, 2017 — forked from otsaloma/remove-duplicate-subs
Remove duplicate subtitles with aeidon
View remove-duplicate-subs
#!/usr/bin/env python3
import aeidon, sys, time
if len(sys.argv) < 2:
print("Usage: {} SUBTITLE_FILE...".format(__file__))
raise SystemExit(1)
for fname in sys.argv[1:]:
project = aeidon.Project()
project.open_main(fname, "utf_8")
before = len(project.subtitles)
#!/usr/bin/env python
import re
def is_balanced(text):
"""Given text containing only braces ((, ), {, }), returns `True`
if they can be balanced. Returns `False` otherwise.
Curly braces ({ and }) are treated as optional.
View Facebook Hackercup

Disclaimer: I have no idea if this are indeed the correct answers. I just solved the exercises like this. I think that they are right though.

I have added my own code to this gist. It is ugly as hell, just like you can expect from code created in a contest like this.

Beautiful Strings

Difficulty: easy

It is simple to see that a greedy solution is good enough.

#!/usr/bin/env python
# -*- coding: utf-8 -*-
import string
import re
INPUT_FILE = 'balanced_smileystxt.txt'
input = open(INPUT_FILE, 'r')