deveah

.equ DDRB,   0x04
.equ PORTB,  0x05

.equ TCCR0B, 0x25
.equ TCNT0,  0x26
.equ TIMSK0, 0x6e

.equ SPL,    0x3d
.equ SPH,    0x3e

deveah

#include <unistd.h>
#include <sys/wait.h>
#include <sys/types.h>
#include <stdio.h>

pid_t children[10];
int n_children = 0;

int main(int argc, char **argv)

deveah

import java.util.ArrayList;

public class Duel {

	private static ArrayList<Duelist> duelists;
	private static int nDuels = 10000;

	/*
	 *	main(): entry point of application.

deveah

/*	problema 3 - liste */
/*	gcc trei.c -o trei -Wall -Wextra -ansi -g3 */

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

struct categorie
{

deveah

/*	problema 2 - liste */
/*	gcc doi.c -o doi -Wall -Wextra -ansi -g3 */

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

struct obiect
{
	int data;

deveah

/*	problema 1 - liste */
/*	gcc unu.c -o unu -Wall -Wextra -ansi -g3 */

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

#define DIM 3

int main( int argc, char **argv )

deveah

/*
 *	hashtable.c
 *	A straightforward, and apparently memory safe, hash table implementation;
 *	it seems to work even with as low as two buckets!
 *
 *	This code is Public Domain.
 *
 *	TODO:
 *	- use unsigned int for sizes

deveah

/*	TODO:
	* how to handle collisions?
	* how probable are collisions for relatively small tables?
*/

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

deveah

local Entity = {}
Entity.__index = Entity

function Entity.new( name )
	assert( type( name ) == "string" )

	local e = {}
	setmetatable( e, Entity )

deveah

#include <stdio.h>

typedef struct
{
	char *name;
	int damage, accuracy;
	int ammo;
} weapon_t;