pr4v33n

lorem ipsum dolor

pr4v33n

a,b,c,d := c,d,a-c*q,b-d*q

declare 4 temporary variables ta, tb, tc, td

then do

ta = a;
tb = b;
tc = c;
td = d;

pr4v33n

#include <iostream>
#include <cmath>
#include <cstdlib>
#include <iomanip>

using namespace std;

void foo(int, int, double, double);
double calculate_CI(int, int, double, double);

pr4v33n

/* Author: http://twitter.com/jaz303  */

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

#define THROW(str) \
	if (exception_count < 0) { \
		fprintf(stderr, "unhandled exception '%s' at line %d in %s\n", str, __LINE__, __FILE__); \

pr4v33n

/*
 * program: naturalmergesort.cpp
 * Program is an implementation of a 2-way natural mergesort with the addition,
 * that it counts the number of comparisions needed by the merging-process.
 */

#include <iostream>

using namespace std;

pr4v33n

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

int main(void)
{
    char **zoznam;
    zoznam = (char**)malloc(10*sizeof(char*));
    int i;
    for (i = 0; i < 10; i++)

pr4v33n

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

int main(int argc, char *argv[])
{
    char pattern[] = "/tmp/*.txt";
    glob_t globbuf;
    FILE *file;

pr4v33n

struct_jobInfo *parseJobs(struct_jobInfo *numbers) {

    char pattern[] = "/.dm/*.*.dm";
    glob_t globbuf;
    FILE *file;
    unsigned int i=0, n=0;
    long long unsigned size;
    char buffer[256];

    size = (sizeof(struct struct_jobInfo) * MAXJOBS);

pr4v33n

// http://min.us/mvk51zd
#include <iostream>
#include <cmath>
#include <iomanip>
#include <cstdlib>

using namespace std;

double machin(void) {
    long double pi_approx = 0.0L, t;

pr4v33n

/**

* A class that models a combination lock.

*/

public class ComboLock

{