peterssonjesper

#include <stdio.h>
#define ROWS 1001

int main() {
	int levels;
	int sum = 0;
	int corner = 1;
	int row_length = 2;
	for(levels = 0; levels < ROWS/2; ++levels) {
		sum += (2*corner + row_length*3)*2;

peterssonjesper

from math import sqrt

d = pow(10, 6)
factors = [-1, -1] 
primes = []

def phi(i):
   res = 1 
   index = 0 
   while index < len(factors[i]):

peterssonjesper

#include <iostream>

void tree(int d, int n);
long long int found = 0;
int target = 1000000;

void tree(int d, int n) {
	if(d > target)
		return;
	found += 1;

peterssonjesper

// Parent class with two properties, one integer and one object
var ParentClass = function() {
	this.counter = 0;
	this.obj = { counter : 0 };
	this.inca = function() {
		this.counter++;
		this.obj.counter++;
	}
};

peterssonjesper

#!/usr/bin/python
import sys, re, os

SCAN_EXTENSIONS = ["js", "html", "php", "py", "rb"]

def error_in_line(line):
   return True if re.search(",}", line) else False# Check inside a line

def search_file(filename):
   try: