Skip to content

Instantly share code, notes, and snippets.

class BinaryTree:
def __init__(self,rootObj):
self.key = rootObj
self.leftChild = None
self.rightChild = None
def insertLeft(self,newNode):
if self.leftChild == None:
self.leftChild = BinaryTree(newNode)
else:
ּ_בּ
בּ_בּ
טּ_טּ
כּ‗כּ
לּ_לּ
מּ_מּ
סּ_סּ
תּ_תּ
٩(×̯×)۶
٩(̾●̮̮̃̾•̃̾)۶
#include <iostream>
#include "matrix.h"
using std::cout;
using std::cin;
int main(void){
/*Matrix mt2(3, 4);
mt2.dbg_print();
return 0;*/
import sys
#from __future__ import division
from stack import Stack
def main():
expression = sys.argv[1]
stack = Stack()
expression.split()
for item in expression:
section .data
extern _aa, _bb, _cc, _hh, _ll, _rr
section .text
global _e27
_e27:
;вычисление знаменателя
mov ax, [_aa]
xor dx, dx
mov bx, 2
div bx
@cryptohedge
cryptohedge / mmm
Last active January 3, 2016 08:09
global main
extern printf
extern puts
extern scanf
extern exit
section .text
main:
push dword hint1
.section .text
.global_ASM_SCalc:
.intel_syntax noprefix
push ebp
mov ebp, esp
mov eax, [ebp + 8]
mov ebx, [ebp + 12]
cmp eax, ebx
jl less
jg great
ּ_בּ
בּ_בּ
טּ_טּ
כּ‗כּ
לּ_לּ
מּ_מּ
סּ_סּ
תּ_תּ
٩(×̯×)۶
٩(̾●̮̮̃̾•̃̾)۶
! Base16 Default
! Scheme: Chris Kempson (http://chriskempson.com)
#define base00 #151515
#define base01 #6a9fb5
#define base02 #303030
#define base03 #505050
#define base04 #b0b0b0
#define base05 #d0d0d0
#define base06 #e0e0e0