dd1994

Prerequisites

• a vswap OpenVZ VPS or a KVM/Xen/VMware VPS with Ubuntu Server 12.04 LTS installed (architecture doesn't matter), or a dedicated server
• patience and a willingness to learn
• approximately 10 minutes of time

Why Ubuntu LTS?

dd1994

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

void func(char *, char *);

int main(void)
{
    char str1[80], str2[80];

    gets(str1);

dd1994

#include<stdio.h>

void func(int);

int main(void)
{
  int n;

  while(scanf("%d", &n) != EOF)
  {

dd1994

#include <stdio.h>

void sumDiff(int , int , int *, int *);

int main(void)
{
  int a, b, sum, diff;

  while(scanf("%d %d", &a, &b) != EOF)
  {

dd1994

#include <stdio.h>


void func(int a[100][100], int m, int n)
{
  int i, j;

  for (i = 1; i < m; ++i)
  {
    for (j = 0; j < n; ++j)

dd1994

#!/usr/bin/env python2
# vim: set fileencoding=utf8

import os
import sys
import requests
import urlparse
import re
import argparse
import random

dd1994

//Matrix multiplication
//matrix1: m x s
//matrix2: s x n

#include <stdio.h>

void matrixInput(int m, int n, float (*a)[n]);

void MatrixMultiply(int m, int s, int n,
    float (*matrix1)[s], float (*matrix2)[n], 

dd1994

#include <stdio.h>
#define MaxVertices 100

typedef struct{
  int vertices[MaxVertices];
  int edge[MaxVertices][MaxVertices];
  int numV;
}adjMatrix;

void createGraph(adjMatrix *G, int n)

dd1994

#define MaxVertices 100

typedef struct{
  int vertices[MaxVertices];
  int edge[Maxvertices];
  int numV;
  int numE;
}adjMatrix;

void createGraph(adjMatrix &G, int n, int E)

dd1994

______ad88888888888888888888888a, 
________a88888"8888888888888888888888, 
______,8888"__"P88888888888888888888b, 
______d88_________`""P88888888888888888, 
_____,8888b_______________""88888888888888, 
_____d8P'''__,aa,______________""888888888b 
_____888bbdd888888ba,__,I_________"88888888, 
_____8888888888888888ba8"_________,88888888b 
____,888888888888888888b,________,8888888888 
____(88888888888888888888,______,88888888888,