Goal
Once upon a time the guy with well-known name Julius Caesar created a cipher, which later was called "Caesar Box".
The task is to help his nephew, Augustus in decoding this powerful cipher.
To decode the message, you have to do four steps:
1) Count the length of the given message
2) Determine how many rows you can divide the letters into equally (Number of columns will be equal to number of rows)
3) Write the letters out into the box(table) - put characters into rows of determined length
4) Start from the top left letter and read down to the bottom left letter, then start at the top of the next column and read down again, and so on
EXAMPLE FOR DECODING :
I. Given a string "CiaonmdGe" (9 characters)
II.Divide it in equals rows and columns (here 3 rows, 3 columns):
Cia
onm
dGe
III. Print the concatenation of all the columns, from top do bottom, from left to right in one line :
"CodinGame" (C+o+d+i+n+G+a+m+e)
Good luck with decoding!
Solution
Using two loops makes the algorithm pretty straighforward to implement. First calculate the square root and then loop two times to the square root. As it is ensured that the given string is of quadratic length, this makes it much easier to work with. So the first shot looks like this:
m=readline()
r=Math.sqrt(m.length)
s=""
for(i = 0; i < r; i++)
for(j = 0; j < r; j++) s+= m[j * r + i]
print(s)
Another idea is to get rid of the inner loop and calculate i and j based on a running index:
m=readline()
l=m.length
r=Math.sqrt(l)
s=""
for(z = 0; z < l; z++){
j = z % r
i = z / r | 0
s+= m[j * r + i]
}
print(s)
When compressed, the following 82 char solution can be achieved:
m=readline()
r=Math.sqrt(l=m.length)
s=""
for(z=0;z<l;)s+=m[z%r*r+z++/r|0]
print(s)