kylelk

/* Frequency of words
 *
 * This program reads the standard input,
 * counts word frequencies
 * and output them in a list sorted by frequencies.
 *
 * Author: Andreas Abel, andreas.abel@ifi.lmu.de
 * This code is placed in the public domain.
 * Do with it what you like, but leave my name in it.
 */

kylelk

section     .text
 global _start                     

_syscall:           
     int     0x80            
     ret

_start:                        

     push    dword len       

kylelk

/*
   avidump.c

   simple format info and dump utility for jpeg codestreams

   Copyright (C) 2006 Ralph Giles. All rights reserved.

   Distributed under the terms of the GNU GPL.
   See http://www.gnu.org/ for details.
*/

kylelk

/* \begin{verbatim}
/* -------------------------------------------------------------

   Module:   xgcd.c

   Description:

        Extended Euclidean Algorithm
        finding the greatest common divisor

kylelk

//h = 0x68
//e = 0x65
//l = 0x6c
//l = 0x6c
//o = 0x6f
//  = 0x20
//w = 0x77
//o = 0x6f
//r = 0x72
//l = 0x6c

kylelk

/* nccolour.c - Print out some ncurses colours.
 * 
 * Compile using:
 *   gcc nccolour.c -o nccolour -lncurses
 *
 * Written by Yoran Heling <projects@yorhel.nl>
 *
 *    Date: 2011-06-11
 * License: MIT
 *     Web: http://dev.yorhel.nl/dump/nccolour

kylelk

import java.security.*;
public class Test {
    public static void main(String[] args) throws NoSuchAlgorithmException, NoSuchProviderException {
        KeyPairGenerator keyGen = KeyPairGenerator.getInstance("RSA");
        keyGen.initialize(512);
        byte[] publicKey = keyGen.genKeyPair().getPublic().getEncoded();
        StringBuffer retString = new StringBuffer();
        for (int i = 0; i < publicKey.length; ++i) {
            retString.append(Integer.toHexString(0x0100 + (publicKey[i] & 0x00FF)).substring(1));
        }

kylelk

https://github.com/oNaiPs/droid-VNC-server

kylelk

#include <stdio.h>

void pascaltriangle(unsigned int n)
{
	unsigned int c, i, j, k;

	for (i = 0; i < n; i++)
	{
		c = 1;
		for (j = 1; j <= 2 * (n - 1 - i); j++)

kylelk

#include <stdio.h> 
#include <string.h>
#include <sys/types.h> 
#include <sys/socket.h> 
#include <netdb.h>

const char *msg = "hello socket world";

int main()
{