This file contains 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
import cv2 | |
import os | |
import glob | |
from deepface import DeepFace | |
videos_folder = 'videos/' | |
output_folder = 'output_frames/' | |
if not os.path.exists(output_folder): | |
os.makedirs(output_folder) |
This file contains 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
# sudo apt install -y && sudo apt-get -y install libcogl-pango-dev && pip install manim | |
from manim import * | |
from math import * | |
class KleinBottle(ThreeDScene): | |
def construct(self): | |
def klein_bottle(u, v): | |
u = u * 2 * PI | |
v = v * 2 * PI | |
half = (u < PI) |
This file contains 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
(define (compose-list fs) | |
(lambda (x) | |
(foldr (lambda (f acc) (f acc)) x fs))) | |
(define (add1 x) (+ x 1)) | |
(define (number->string x) (number->string x)) | |
((compose-list (list number->string add1)) 3) |
This file contains 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
pub mod overlapping_line { | |
#[derive(Debug, Clone)] | |
pub enum Linetree { | |
Empty, | |
Filled, | |
Node { | |
pivot: i64, | |
left: Box<Linetree>, | |
right: Box<Linetree>, | |
} |
This file contains 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
def power_set(original_set): | |
if not original_set: | |
return [set()] | |
element = original_set.pop() | |
subsets_without_element = power_set(original_set) | |
subsets_with_element = [] | |
for subset in subsets_without_element: | |
new_subset = subset.copy() | |
new_subset.add(element) | |
subsets_with_element.append(new_subset) |
This file contains 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> | |
<!-- THIS IS CODE DONE IN 20 MINUTES, NOT THE BEST LOOKING CODE OUT THERE --> | |
<html lang="en"> | |
<head> | |
<meta charset="UTF-8" /> | |
<meta name="viewport" content="width=device-width, initial-scale=1.0" /> | |
<title>Infix to Prefix Notation Converter</title> | |
<style> | |
@import url("https://fonts.googleapis.com/css2?family=Roboto&display=swap"); | |
body, |
This file contains 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
#lang racket | |
(define (call num1 num2) | |
(let ([x num1] [y num2]) x)) | |
(define (brouhaha_main) | |
(call 5 42)) | |
'((define (call num1 num2) | |
(let ([x num1] [y num2]) x)) |
This file contains 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
#lang racket | |
(define (create-bt line) | |
(match line | |
[`(,x0 ,x1) (if (< x0 x1) `(bt ,x0 empty (bt ,x1 covered empty)) 'empty)] | |
[_ 'error] | |
) | |
) |
This file contains 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> | |
<!--michaelgathara.com--> | |
<title>Michael G | Physics</title> | |
<!--Meta Stuff created April 13th 2019--> | |
<meta name="description" content="Michael Gathara's Ap Physics 1 review site"/> | |
<meta name="robots" content="noindex,nofollow,nosnippet"> | |
<meta name="google" content="nositelinkssearchbox,notranslate" /> | |
<meta name="theme-color" content="#000"> |
This file contains 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
num1 = int(input("Enter your Dividend number: ")) | |
num2 = int(input("Enter you Divisor number: ")) | |
num3 = 0 | |
def findRemainder(first, second): | |
return first%second | |
print(findRemainder(num1, num2)) | |
NewerOlder