UVa 10851

From Algorithmist
Jump to: navigation, search

10851 - 2D Hieroglyphs decoder[edit]

Summary[edit]

Given a representation of the each bit in a matrix of points, decode the hidden message.

Explanation[edit]

The description in the problem makes it seem harder than it is. The way to look at it is, given a binary matrix of "/" or "\"'s, with "\" representing ones, decode the hidden message.

The matrix is always given with the surrounding frame of "/", strip that out, and reconstruct the ASCII value of the character by its bits. Since the number of rows is always ten, that means there are 8 bytes (perfect for a char!). For example, the first row represents the least significant bit, while the first column (after the frames) represents the first character.

Input[edit]

2
///////////////////////////////////////
//\///\/\\/\//\\/\//\/\\/\/\/\\/\/\//\/
///////\////\/\/\//////\//\////\/\/////
/\//\\\\///\\//\\/\\//\//\\//\///\/\\//
/\//\\//\///\////\\\//////\//\////\\\//
//////\\//////\/\//////\/\/////\/\/////
///\//////\//\///////\//\///\//////////
/\\/\\\\\\/\\/\\\\\\\/\\/\\\/\\\\\\\\\/
///////////////////////////////////////
///////////////////////////////////////

///////////
/\/\/\/\/\/
//\\//\\///
////\\\\///
////////\\/
///////////
/\\\\\\\\\/
/\\\\\\\\\/
///////////
///////////

Output[edit]

LA LLUVIA EN SEVILLA ES UNA MARAVILLA
abcdefghi