Tag: day 2

Posts Tagged ‘day 2’

HACKvent 2015: Day 2

07 Dec 2015

CTF: Hackvent 2015
Link to challenge: http://hackvent.hacking-lab.com

Date Completed: 07 December 2015

Challenge

Clue: I wonder if this is the native language of one of you!
pagh wa'vatlh netlh wa'maH wa'maH wa' SaD wa' SaD wa'vatlh wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'maH wa'maH netlh pagh wa'maH wa' wa'vatlh wa' wa'vatlh SaD SaD wa' wa'vatlh netlh wa'maH wa' wa'maH wa'maH wa'vatlh wa' wa'maH wa'maH wa' wa' wa'vatlh SaD wa' wa'maH wa'maH wa'maH wa'vatlh wa'maH SaD wa'maH wa' wa'maH wa'maH wa' wa' wa' wa'maH wa'vatlh wa' wa'vatlh wa' SaD wa' SaD wa'maH wa' wa' wa'maH wa' SaD  wa'maH wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'vatlh wa' wa'maH wa' wa' wa'maH wa' netlh wa'maH wa'vatlh wa' wa' wa' wa'vatlh wa'maH wa' wa'maH wa'maH SaD wa' wa'vatlh wa'maH SaD wa'vatlh wa' wa'maH SaD wa' wa'maH SaD

Clue: I wonder if this is the native language of one of you!

pagh wa'vatlh netlh wa'maH wa'maH wa' SaD wa' SaD wa'vatlh wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'maH wa'maH netlh pagh wa'maH wa' wa'vatlh wa' wa'vatlh SaD SaD wa' wa'vatlh netlh wa'maH wa' wa'maH wa'maH wa'vatlh wa' wa'maH wa'maH wa' wa' wa'vatlh SaD wa' wa'maH wa'maH wa'maH wa'vatlh wa'maH SaD wa'maH wa' wa'maH wa'maH wa' wa' wa' wa'maH wa'vatlh wa' wa'vatlh wa' SaD wa' SaD wa'maH wa' wa' wa'maH wa' SaD wa'maH wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'vatlh wa' wa'maH wa' wa' wa'maH wa' netlh wa'maH wa'vatlh wa' wa' wa' wa'vatlh wa'maH wa' wa'maH wa'maH SaD wa' wa'vatlh wa'maH SaD wa'vatlh wa' wa'maH SaD wa' wa'maH SaD

Solution

After some Googling I realise this is the Klingon language from Star Trek.
I try some online translators (including Bing!) and it is clear that the message is a series of numbers that contain 0 or 1 only.
This is most likely binary that represents ASCII text.

I write a small script to convert each component in the text (based on a Klingon number guide):

import sys
text = """pagh wa'vatlh netlh wa'maH wa'maH wa' SaD wa' SaD wa'vatlh wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'maH wa'maH netlh pagh wa'maH wa' wa'vatlh wa' wa'vatlh SaD SaD wa' wa'vatlh netlh wa'maH wa' wa'maH wa'maH wa'vatlh wa' wa'maH wa'maH wa' wa' wa'vatlh SaD wa' wa'maH wa'maH wa'maH wa'vatlh wa'maH SaD wa'maH wa' wa'maH wa'maH wa' wa' wa' wa'maH wa'vatlh wa' wa'vatlh wa' SaD wa' SaD wa'maH wa' wa' wa'maH wa' SaD  wa'maH wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'vatlh wa' wa'maH wa' wa' wa'maH wa' netlh wa'maH wa'vatlh wa' wa' wa' wa'vatlh wa'maH wa' wa'maH wa'maH SaD wa' wa'vatlh wa'maH SaD wa'vatlh wa' wa'maH SaD wa' wa'maH SaD"""
for word in text.split():
if word == "pagh":
sys.stdout.write(str(0))
elif word == "wa'maH":
sys.stdout.write(str(10))
elif word == "wa'vatlh":
sys.stdout.write(str(100))
elif word == "wa'":
sys.stdout.write(str(1))
elif word == "SaD":
sys.stdout.write(str(1000))
elif word == "netlh":
sys.stdout.write(str(10000))
else:
print "ERROR! Unknown"

import sys

text = """pagh wa'vatlh netlh wa'maH wa'maH wa' SaD wa' SaD wa'vatlh wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'maH wa'maH netlh pagh wa'maH wa' wa'vatlh wa' wa'vatlh SaD SaD wa' wa'vatlh netlh wa'maH wa' wa'maH wa'maH wa'vatlh wa' wa'maH wa'maH wa' wa' wa'vatlh SaD wa' wa'maH wa'maH wa'maH wa'vatlh wa'maH SaD wa'maH wa' wa'maH wa'maH wa' wa' wa' wa'maH wa'vatlh wa' wa'vatlh wa' SaD wa' SaD wa'maH wa' wa' wa'maH wa' SaD wa'maH wa' wa'maH wa'maH wa'vatlh wa'maH wa' wa'vatlh wa' wa'maH wa' wa' wa'maH wa' netlh wa'maH wa'vatlh wa' wa' wa' wa'vatlh wa'maH wa' wa'maH wa'maH SaD wa' wa'vatlh wa'maH SaD wa'vatlh wa' wa'maH SaD wa' wa'maH SaD"""

for word in text.split():

if word == "pagh":

sys.stdout.write(str(0))

elif word == "wa'maH":

sys.stdout.write(str(10))

elif word == "wa'vatlh":

sys.stdout.write(str(100))

elif word == "wa'":

sys.stdout.write(str(1))

elif word == "SaD":

sys.stdout.write(str(1000))

elif word == "netlh":

sys.stdout.write(str(10000))

else:

print "ERROR! Unknown"

This prints out some binary:

0100100001010110001100010011010100101101010000010110011001000100011001000010110101001101011100100011010101001010001011010111101001100110001100010111011000101101010010110011011101100001010011110010110101000110010100010011010001101000

1	0100100001010110001100010011010100101101010000010110011001000100011001000010110101001101011100100011010101001010001011010111101001100110001100010111011000101101010010110011011101100001010011110010110101000110010100010011010001101000

Total number of bits is 232 and 232/8 bits = 29 bytes.
This is exactly the number of characters in our nugget!

We convert the binary to ASCII and get the flag:
HV15-AfDd-Mr5J-zf1v-K7aO-FQ4h

No Comments

Posted Mo BeigiPersianMG in Hackvent 2015

Advent Of Code 2015: Day 2

02 Dec 2015

CTF: Advent Of Code 2015
Link to challenge: http://adventofcode.com

Date Completed: 02/12/2015

The Challenge

--- Day 2: I Was Told There Would Be No Math ---
The elves are running low on wrapping paper, and so they need to submit an order for more. They have a list of the dimensions (length l, width w, and height h) of each present, and only want to order exactly as much as they need.
Fortunately, every present is a box (a perfect right rectangular prism), which makes calculating the required wrapping paper for each gift a little easier: find the surface area of the box, which is 2*l*w + 2*w*h + 2*h*l. The elves also need a little extra paper for each present: the area of the smallest side.
For example:
A present with dimensions 2x3x4 requires 2*6 + 2*12 + 2*8 = 52 square feet of wrapping paper plus 6 square feet of slack, for a total of 58 square feet.
A present with dimensions 1x1x10 requires 2*1 + 2*10 + 2*10 = 42 square feet of wrapping paper plus 1 square foot of slack, for a total of 43 square feet.
All numbers in the elves' list are in feet. How many total square feet of wrapping paper should they order?
--- Part Two ---
The elves are also running low on ribbon. Ribbon is all the same width, so they only have to worry about the length they need to order, which they would again like to be exact.
The ribbon required to wrap a present is the shortest distance around its sides, or the smallest perimeter of any one face. Each present also requires a bow made out of ribbon as well; the feet of ribbon required for the perfect bow is equal to the cubic feet of volume of the present. Don't ask how they tie the bow, though; they'll never tell.
For example:
A present with dimensions 2x3x4 requires 2+2+3+3 = 10 feet of ribbon to wrap the present plus 2*3*4 = 24 feet of ribbon for the bow, for a total of 34 feet.
A present with dimensions 1x1x10 requires 1+1+1+1 = 4 feet of ribbon to wrap the present plus 1*1*10 = 10 feet of ribbon for the bow, for a total of 14 feet.
How many total feet of ribbon should they order?

--- Day 2: I Was Told There Would Be No Math ---

The elves are running low on wrapping paper, and so they need to submit an order for more. They have a list of the dimensions (length l, width w, and height h) of each present, and only want to order exactly as much as they need.

Fortunately, every present is a box (a perfect right rectangular prism), which makes calculating the required wrapping paper for each gift a little easier: find the surface area of the box, which is 2*l*w + 2*w*h + 2*h*l. The elves also need a little extra paper for each present: the area of the smallest side.

For example:

A present with dimensions 2x3x4 requires 2*6 + 2*12 + 2*8 = 52 square feet of wrapping paper plus 6 square feet of slack, for a total of 58 square feet.

A present with dimensions 1x1x10 requires 2*1 + 2*10 + 2*10 = 42 square feet of wrapping paper plus 1 square foot of slack, for a total of 43 square feet.

All numbers in the elves' list are in feet. How many total square feet of wrapping paper should they order?

--- Part Two ---

The elves are also running low on ribbon. Ribbon is all the same width, so they only have to worry about the length they need to order, which they would again like to be exact.

The ribbon required to wrap a present is the shortest distance around its sides, or the smallest perimeter of any one face. Each present also requires a bow made out of ribbon as well; the feet of ribbon required for the perfect bow is equal to the cubic feet of volume of the present. Don't ask how they tie the bow, though; they'll never tell.

For example:

A present with dimensions 2x3x4 requires 2+2+3+3 = 10 feet of ribbon to wrap the present plus 2*3*4 = 24 feet of ribbon for the bow, for a total of 34 feet.

A present with dimensions 1x1x10 requires 1+1+1+1 = 4 feet of ribbon to wrap the present plus 1*1*10 = 10 feet of ribbon for the bow, for a total of 14 feet.

How many total feet of ribbon should they order?

Solution

This challenge was very simple. I whipped up a short python script that solves it. The use of sorted to get the second smallest integer is not pretty but insignificant with such small numbers.

# Day 2 - Part 1 and 2
with open('input.txt') as f:
lines = f.readlines()
totalPaper = 0
totalRibbon = 0
for line in lines:
l,w,h = map(int, line.split('x'))
totalPaper += (2*l*w + 2*w*h + 2*h*l) + min(l*w, w*h, h*l)
totalRibbon += min(l,w,h)*2 + sorted([l,w,h])[1] * 2 + (l*w*h)
# answers
print "Total wrapping paper needed:", totalPaper
print "Total ribbon needed:", totalRibbon

# Day 2 - Part 1 and 2

with open('input.txt') as f:

lines = f.readlines()

totalPaper = 0

totalRibbon = 0

for line in lines:

l,w,h = map(int, line.split('x'))

totalPaper += (2*l*w + 2*w*h + 2*h*l) + min(l*w, w*h, h*l)

totalRibbon += min(l,w,h)*2 + sorted([l,w,h])[1] * 2 + (l*w*h)

# answers

print "Total wrapping paper needed:", totalPaper

print "Total ribbon needed:", totalRibbon

No Comments

Posted Mo BeigiPersianMG in Advent Of Code 2015

Mo Beigi

Posts Tagged ‘day 2’

HACKvent 2015: Day 2

Challenge

Solution

Advent Of Code 2015: Day 2

The Challenge

Solution

Pages

Recent Posts

Recent Comments

My Networks

Site Stats