Skip to content

Instantly share code, notes, and snippets.

View TheSharpOwl's full-sized avatar
🦊

Mohamad Ziad Alkabakibi TheSharpOwl

🦊
View GitHub Profile
@TheSharpOwl
TheSharpOwl / cheatsheet.md
Created January 30, 2020 19:30 — forked from LKS90/cheatsheet.md
Cheatsheet for LaTex, using Markdown for markup. I use this with atom.io and markdown-preview-plus to write math stuff

Description

Cheatsheet for LaTex, using Markdown for markup. I use this with atom.io and 📦markdown-preview-plus to write math stuff. 📦keyboard-localization is necessary when using an international layout (like [swiss] german).

Further Reference and source: ftp://ftp.ams.org/pub/tex/doc/amsmath/short-math-guide.pdf

Example expressions / functions

@TheSharpOwl
TheSharpOwl / singlyLinkedList.c
Created March 14, 2019 08:16 — forked from ArnonEilat/singlyLinkedList.c
Very simple singly linked list implementation in C with usage example.
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int info;
} DATA;
typedef struct node {
DATA data;
struct node* next;
@TheSharpOwl
TheSharpOwl / LinkedList.java
Created February 12, 2019 18:55 — forked from ericrswanny/LinkedList.java
A linked list class implemented in Java
/*============================================================================
Name : LinkedList.java
Author : Eric Swanson
Date : Sep 7, 2011
Version :
Description :
Copyright (C) 2011 Eric Swanson
This program is free software: you can redistribute it and/or modify
@TheSharpOwl
TheSharpOwl / A - Bali Sculptures.cpp
Created February 27, 2017 17:37 — forked from johnchen902/A - Bali Sculptures.cpp
APIO 2015 Solution in Code
#include <cstdio>
#include <algorithm>
using namespace std;
int n, a, b;
int y[2000];
long long sum[2001];
bool dp1[101][101];
bool ok1(long long mask) {
@TheSharpOwl
TheSharpOwl / A - Bali Sculptures.cpp
Created February 27, 2017 17:37 — forked from johnchen902/A - Bali Sculptures.cpp
APIO 2015 Solution in Code
#include <cstdio>
#include <algorithm>
using namespace std;
int n, a, b;
int y[2000];
long long sum[2001];
bool dp1[101][101];
bool ok1(long long mask) {