Tak31337

package com.taksmind.karma.plugin;

import java.io.File;
import java.io.FileInputStream;
import java.io.FilenameFilter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Properties;
import java.util.Scanner;

Tak31337

{
  "name":"test",
  "command":"python plugins/test.py",
  "description":"test plugin",
  "trigger":"~test"
}

Tak31337

#!/usr/bin/env python
import sys
import urllib2
import logging

def _exploit(log):
    url="http://www.someurl.com/index.php?spec="
    opener = urllib2.build_opener(urllib2.HTTPHandler)
    while True:
        input = raw_input('>')

Tak31337

package com.taksmind.subnetting;

import org.eclipse.swt.widgets.Composite;
import org.eclipse.swt.widgets.Text;

public class NetText extends Text {
	
	private String name;
	
	public NetText(Composite parent, int style) {

Tak31337

package com.taksmind.coffee;

import java.applet.Applet;
import java.applet.AppletContext;
import java.applet.AppletStub;
import java.awt.BorderLayout;
import java.awt.Container;
import java.awt.Dimension;
import java.net.URL;
import java.net.URLClassLoader;

Tak31337

####################
##S      ##    ### #
## #####    ##     #
##    ##############
##### ######       #
#####     ## ####  #
##### ### ## ####  E
##### ### ## #######
#     ###    #######
####################

Tak31337

#!/usr/bin/env python3
'''
This program will first analyze the maze and fill out a two dimensional list with elements
contained within the input file, making note of the start point

The program will then explore neighboring cells from the start location starting with the right cell
by passing the location to a method which will process the cell, and mark it as explored, or maze solved.

The program will make note if there is more than one exploratory juxtaposing cell, and store the cell 
location into a list ordered latest found to earliest found, then note cells explored after this into