Congee

#include <stdio.h>

int main(void) {
	char a[] = "ABCD";
	char b[] = "BCDE";
	char c[] = "CDEF";
	
	puts(a);
	puts(b);
	puts(c);

marcoscastro

// Exemplo de geração de números aleatórios

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

/*
	A função gerar_numero() retorna um número aleatório
	que pertence ao intervalo [lim_inf, lim_sup]
	

niw

/*
 * A simple libpng example program
 * http://zarb.org/~gc/html/libpng.html
 *
 * Modified by Yoshimasa Niwa to make it much simpler
 * and support all defined color_type.
 *
 * To build, use the next instruction on OS X.
 * $ brew install libpng
 * $ clang -lz -lpng16 libpng_test.c

yamamushi

// Bresenham3D
//
// A slightly modified version of the source found at
// http://www.ict.griffith.edu.au/anthony/info/graphics/bresenham.procs
// Provided by Anthony Thyssen, though he does not take credit for the original implementation
//
// It is highly likely that the original Author was Bob Pendelton, as referenced here
//
// ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d
//

ArnonEilat

#include "BinarySearchTree.h"

/*! \fn Tree * add(Tree *nod , int number)
 *  \param *nod pointer to <tt>Tree</tt> struct.
 *  \param number a <tt>int</tt> to add.
 *  \return pointer to <tt>Tree</tt> struct.
 */
Tree * add(Tree* nod, int number) {
    if (nod == NULL) {
        nod = (Tree*) malloc(sizeof (Tree));

1wErt3r

;SMBDIS.ASM - A COMPREHENSIVE SUPER MARIO BROS. DISASSEMBLY
;by doppelganger ([email protected])

;This file is provided for your own use as-is.  It will require the character rom data
;and an iNES file header to get it to work.

;There are so many people I have to thank for this, that taking all the credit for
;myself would be an unforgivable act of arrogance. Without their help this would
;probably not be possible.  So I thank all the peeps in the nesdev scene whose insight into
;the 6502 and the NES helped me learn how it works (you guys know who you are, there's no 

codebrainz

D			[0-9]
L			[a-zA-Z_]
H			[a-fA-F0-9]
E			([Ee][+-]?{D}+)
P                       ([Pp][+-]?{D}+)
FS			(f|F|l|L)
IS                      ((u|U)|(u|U)?(l|L|ll|LL)|(l|L|ll|LL)(u|U))

%{
#include <stdio.h>

bert

Some possible implementations of the Bresenham Algorithms in C.

The Bresenham line algorithm is an algorithm which determines which points in an
n-dimensional raster should be plotted in order to form a close approximation
to a straight line between two given points.
It is commonly used to draw lines on a computer screen, as it uses only integer
addition, subtraction and bit shifting, all of which are very cheap operations
in standard computer architectures.
It is one of the earliest algorithms developed in the field of computer graphics.
A minor extension to the original algorithm also deals with drawing circles.

carlosbrando

#include <stdio.h>
#include <stdlib.h>

struct tree {
    char info;
    struct tree *left;
    struct tree *right;
};

struct tree *root; /* o primeiro nó da árvore */

creaktive

/*
   PC Emulator

   Copyright (c) 2011 Fabrice Bellard

   Redistribution or commercial use is prohibited without the author's
   permission.
*/
"use strict";
var aa;