readme.txt:

challenge I - Dodge the Lasers!:

Oh no! You’ve managed to escape Commander Lambda’s collapsing space station in an escape pod with the rescued bunny workers - but Commander Lambda isnt about to let you get away that easily. Lambda sent an elite fighter pilot squadron after you – and they’ve opened fire!

Fortunately, you know something important about the ships trying to shoot you down. Back when you were still Lambda’s assistant, the Commander asked you to help program the aiming mechanisms for the starfighters. They undergo rigorous testing procedures, but you were still able to slip in a subtle bug. The software works as a time step simulation: if it is tracking a target that is accelerating away at 45 degrees, the software will consider the targets acceleration to be equal to the square root of 2, adding the calculated result to the targets end velocity at each timestep. However, thanks to your bug, instead of storing the result with proper precision, it will be truncated to an integer before adding the new velocity to your current position. This means that instead of having your correct position, the targeting software will erringly report your position as sum(i=1..n, floor(i*sqrt(2))) - not far enough off to fail Commander Lambdas testing, but enough that it might just save your life.

If you can quickly calculate the target of the starfighters’ laser beams to know how far off they’ll be, you can trick them into shooting an asteroid, releasing dust, and concealing the rest of your escape. Write a function solution(str_n) which, given the string representation of an integer n, returns the sum of (floor(1sqrt(2)) + floor(2sqrt(2)) + … + floor(nsqrt(2))) as a string. That is, for every number i in the range 1 to n, it adds up all of the integer portions of isqrt(2).

For example, if str_n was “5”, the solution would be calculated as

1
2
3
4
5
6

floor(1*sqrt(2)) +
floor(2*sqrt(2)) +
floor(3*sqrt(2)) +
floor(4*sqrt(2)) +
floor(5*sqrt(2))
= 1+2+4+5+7 = 19

so the function would return “19”.

str_n will be a positive integer between 1 and 10^100, inclusive. Since n can be very large (up to 101 digits!), using just sqrt(2) and a loop won’t work. Sometimes, it’s easier to take a step back and concentrate not on what you have in front of you, but on what you don’t.

1
2
3
4
5

solution.solution('77')
4208

solution.solution('5')
19

solution.py:

challenge I - Disorderly Escape:

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15

# source: https://www.oasys.net/posts/google-foobar-programming-challenge/

from decimal import Decimal, getcontext


def S(a, n):
    if n == 0:
        return 0
    np = int((a - 1) * n)
    return n * np + n * (n + 1) / 2 - np * (np + 1) / 2 - S(a, np)


def solution(s):
    getcontext().prec = 101
    return str(S(Decimal(2).sqrt(), int(s)))