bricakeld

// Asia-Tsukuba 2015 Regionals

#include <iostream>
#include <cstring>
#include <cmath>

using namespace std;

int main() {
    int n, temp, i, smallest, tempj;

bricakeld

# I mainly use c++ to solve the problems but I use mainly Python in my school, so I thought I'd give Python a try in such problems
# Python3

import sys
import collections

n = int(sys.stdin.readline())

in_names = sys.stdin.readline().split()

bricakeld

import sys
import os
import re

dir = os.path.dirname(__file__)

def usage():
    print('python tree_truncate.py <input dot file> <number of nodes> <optional: output dot file | default=out.dot>')

def check():

bricakeld

Keybase proof

I hereby claim:

• I am bricakeld on github.
• I am aldricbek (https://keybase.io/aldricbek) on keybase.
• I have a public key ASCsXjxofO7ZdGyjxkoyYvMsaEncZ9mdWqO--W1u_uzqKwo

To claim this, I am signing this object: