mfilipelino

def is_prime(number):
    if number <= 0:
        return False
    if number == 1:
        return True
    elif number == 2:
        return True
    else:
        for i in range(2, number):
            if number % i == 0:

mfilipelino

print('hello')

mfilipelino

// Framework unit_test c
#include <stdio.h>
#include <string.h>

// variaveis de teste
int a, *b;

// framework start

mfilipelino

/*
TODO:

function:
[] vector_erase

error:
[] implements error

*/

mfilipelino

#define SPEED 75
#define	INPUT_BLACKCOLOR 1
#define	INPUT_BLUECOLOR 2
#define	INPUT_GREENCOLOR 3
#define	INPUT_YELLOWCOLOR 4
#define	INPUT_REDCOLOR 5
#define	INPUT_WHITECOLOR 6


//************ ÚLTIMO CÓDIGO *****************

mfilipelino

import Queue

Grafo = { 0 : [1, 3],
          1 : [0, 2],
          2 : [1, 3],
          3 : [0, 2] 
}

def queue_insert(q, v):

mfilipelino

#define THRESHOLD 40

struct ColorState {
  int colorval;
  unsigned int raw[];
  unsigned int norm[];
  int scaled[];
};

string debug_std_colors[] = {

mfilipelino

def imprime(letras, vet, lst):
    s = ''
    for x in xrange(len(letras)):
        if vet[x] == True:
            s += letras[x]
    lst.append(s)

def combinacoes(letras, vet, p, n, lst):

mfilipelino

#define WIN32_LEAN_AND_MEAN
#include <Windows.h>
#include <stdint.h> // portable: uint64_t   MSVC: __int64 

// MSVC defines this in winsock2.h!?
typedef struct timeval {
    long tv_sec;
    long tv_usec;
} timeval;

mfilipelino

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;


public class ContainerThreadPool {

	private static ContainerThreadPool contairnerThreadPoll;
	
	public static ContainerThreadPool getInstance() {