wellington-tinho

//quantidade de numeros que cada player pode escolher
const player1 = 2
const player2 = 2

//variaveis auxiliares para armazenar quantidades
var qtd_par = 0;
var qtd_impar = 0;
var soma_par_impar = 0;

//header do console.log

wellington-tinho

import sys
import argparse
import json
import networkx as nx
import community
from networkx.readwrite import json_graph


def graphmltojson(graphfile, outfile):
	"""

wellington-tinho

from itertools import permutations

def Avaliador(lista):
    #linha 1
    result=0
    for i in subset[:3]:
        result=result+i
    if result!=15:
        return False
    

wellington-tinho

//arvore binaria 

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

typedef struct Arvore arv;

struct Arvore{
	int info;
	arv *dir;

wellington-tinho

def calcPosFix():
    expression=list(input('insira a expressao: '))
    
    while(len(expression)>1):
        if (len(expression)>3 and expression[2] == '*' and expression[3] == '*' ):
            value = str(eval(expression[0])**(eval(expression[1])))
            for i in range(4):
                del expression[0]
        
        else: