# Solution of;
# Project Euler Problem 604: Convex path in square
# https://projecteuler.net/problem=604
# 
# Let $F(N)$ be the maximum number of lattice points in an axis-aligned 
# $N\times N$ square that the graph of a single strictly convex increasing 
# function can pass through. You are given that $F(1) = 2$, $F(3) = 3$, $F(9) 
# = 6$, $F(11) = 7$, $F(100) = 30$ and $F(50000) = 1898$. Below is the graph 
# of a function reaching the maximum 3 for $N=3$:Find $F(10^{18})$.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 604
    timed.caller(dummy, n, i, prob_id)
