LXZE

Keybase proof

I hereby claim:

• I am lxze on github.
• I am lxze (https://keybase.io/lxze) on keybase.
• I have a public key ASCi3jBr-i7_DHkJ0QvNmrCkhHZ8cjnMOk9W7lbfQ0G-YQo

To claim this, I am signing this object:

LXZE

from math import sqrt;
from itertools import count, islice
f = open("input.in","r")
w = open("output.txt","w")
num = f.readline()
def convert(input, source, target):
	if source == target: return input
	base = {
		2 :'01',
		3 :'012',

LXZE

f = open("input.in","r")
w = open("output.txt","w")
num = f.readline()

for it in range(0,int(num)):
	pancakes = f.readline().rstrip('\n')
	res = 0
	state = ''
	txt = ''
	for ch in pancakes:

LXZE

f = open("input.in","r")
w = open("output.txt","w")
num = f.readline()
for it in range(0,int(num)):
	res = ''
	num = int(f.readline())
	if num == 0:
		res = 'INSOMNIA'
	else:
		idx = 0

LXZE

# f = open("in2.in","r")
f = open("review_input.txt","r")
w = open("output.txt","w")
num = f.readline()
for it in range(0,int(num)):
	comment = [int(l) for l in f.readline().split()][1:]
	comment.sort()
	res = [ [comment[0],comment[0]] ]
	bf = comment[0]
	for i,num in enumerate(comment[1:]):

LXZE

from itertools import *

def powerset(iterable):
    s = list(iterable)
    return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))

f = open("interstellar_input.txt","r")
# f = open("in.in","r")
w = open("output.txt","w")
num = f.readline()

LXZE

import re
from fractions import gcd
def lcm(numbers):
    return reduce(lambda x, y: (x*y)/gcd(x,y), numbers, 1)
f = open("B-large.in","r")
w = open("output_blarge.txt","w")
num = f.readline()
for i in range(0,int(num)):
	barber,atN = [long(l) for l in f.readline().split()]
	speed = [int(l) for l in f.readline().split()]

LXZE

import re

f = open("A-large.in","r")
w = open("output_aLarge.txt","w")
num = f.readline()
for i in range(0,int(num)):
	res = 0
	smax,aud = [str(l) for l in f.readline().split()]
	clap = int(aud[0])
	for j,nSi in enumerate([int(x) for x in aud]):

LXZE

import java.util.*;
import java.io.*;

public class codejam4{
	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new FileReader("D-large.in"));
		BufferedWriter write = new BufferedWriter(new FileWriter("output.txt"));

		int caseN = sc.nextInt();
		sc.nextLine();

LXZE

import java.util.*;
import java.io.*;
import java.text.*;
public class codejam2{
	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new FileReader("B-large.in"));
		BufferedWriter write = new BufferedWriter(new FileWriter("output.txt"));
		int caseN = sc.nextInt();
		sc.nextLine();
		String[] allCase = new String[caseN];