kiriappeee

Keybase proof

I hereby claim:

• I am kiriappeee on github.
• I am kiriappeee (https://keybase.io/kiriappeee) on keybase.
• I have a public key ASBhPfSLFb2EsOm2HVtWn3-UFcO54bzxzIMO25NxocqnOQo

To claim this, I am signing this object:

kiriappeee

#!/usr/bin/perl

#  ShellBOT

#  0ldW0lf - [email protected]

#      - www.atrix-team.org

# Stealth ShellBot Versão 0.2 by Thiago X

kiriappeee

from collections import defaultdict

UNICODE_BLOCKS = {
	'en': range(0x0000, 0x02AF),
	'si': range(0x0D80, 0x0DFF),
	'ta': range(0x0B80, 0x0BFF),
	'dv': range(0x0780, 0x07BF)
}

def getlang(text):

kiriappeee

import struct
import re

#NOTE that the input file given below won't be the same if you sign up for advent of code to try it out yourself.
#let me know if it doesn't work for you
circuit = {}
def parseInstruction(instruction):
    instructionBreakDown = dict()
    if re.search(r'AND|OR', instruction):
        result = re.findall(r'(\w+|\d+) (AND|OR) (\w+) -> (\w+)', instruction)[0]

kiriappeee

<li class="{{if isCompleted 'completed'}}">
    {{#if isEditing}}
        {{input type="text" class="edit" value=todo.title focus-out="acceptChanges"
        insert-newline="acceptChanges"}}
    {{else}}
        {{input type="checkbox" checked=todo.isCompleted class="toggle"}}
        <label {{action "editTodo" on="doubleClick"}}>{{title}}</label><button class="destroy"></button>
    {{/if}}
</li>

kiriappeee

"""Quick implementation of the Karatsuba multiplication algorithm while doing 
the Stanford Algortihms Design and Analysis Part 1 Course"""
def karatsuba(x,y):
    if x < 10 and y < 10:
        return x*y
    else:
        if x > y:
            divider = pow(10,len(str(x)) / 2)
        else:
            divider = pow(10,len(str(y)) / 2)

kiriappeee

"""As much as I understood the theorems of the monty hall problem 
my brain simply refused to take it in and accept, so I wrote a very quick (and dirty) script to just test it out.
The script randomly generates two goats (designated as 0) and a car (designated by 1) for three doors (stored in a dictionary. I don't know why I
chose that. Anyway. Here's the script... And it works. Funnily enough when writing the program I kept having snippets of thoughts on how staying
with your old choice would leave you at 33% anyways since you didn't take advantage of the situation of knowing one door which had a goat behind it
That prompted me to write the normal test where based on intuition, you'd stick with the door you picked originally. And yes, everything checks out.

Edit: I also thought of the case of what if the game host reveals a door behind which there is a goat BEFORE you make your first pick.
Isn't that like the first scenario but the order just reversed? Apparently not. The results move down to 50-50. My mind

kiriappeee

<grid textelement.fontfamily="Lucida Grande" x:name="LayoutRoot">
    <!-- All other controls in here will automatically inherit Lucida Grande as their font unless specified explicitly not to do so -->
</grid>

kiriappeee

<window.resources> 
  <style targettype="{x:Type ContentControl}" x:key="BaseContentControlStyle">
            <setter Property="Foreground" Value="#FF204E93" />  

        <style basedon="{StaticResource BaseContentControlStyle}" targettype="{x:Type Label}">

        <setter Property="FontSize" Value="9.2pt" />         

        <style basedon="{StaticResource BaseContentControlStyle}" targettype="{x:Type Button}">

kiriappeee

/*Having made a kinect game as promotions for our company, we discovered that there was a problem in taking this game out into 
public and that was that if anyone stood behind the main player the game would just break in the sense
it wouldn't know how to track*/

//the code given by microsoft to activate the kinect tracking is as follows.

playerSkeleton = (from s in skeletonData
         where s.TrackingState == SkeletonTrackingState.Tracked
                 select s).FirstOrDefault();