title: Maximum Games Played Winner
signature: maximumGamesPlayedWinner :: Integer -> Integer
  maximumGamesPlayedWinner n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (73) (8) )
  
      printf "TEST-1...%s\n" (driver (28) (6) )
  
      printf "TEST-2...%s\n" (driver (33) (6) )
  
      printf "TEST-3...%s\n" (driver (23) (6) )
  
      printf "TEST-4...%s\n" (driver (84) (8) )
  
      printf "TEST-5...%s\n" (driver (31) (6) )
  
      printf "TEST-6...%s\n" (driver (48) (7) )
  
      printf "TEST-7...%s\n" (driver (46) (7) )
  
      printf "TEST-8...%s\n" (driver (45) (7) )
  
      printf "TEST-9...%s\n" (driver (90) (9) )
  
source_py: def maximum_games_played_winner(N):
      dp = [0 for i in range(N)]
      dp[0] = 1
      dp[1] = 2
      i = 1
      while (dp[i] <= N):
          i = (i + 1)
          dp[i] = (dp[(i - 1)] + dp[(i - 2)])
      return (i - 1)
source_cpp: int maximum_games_played_winner(int N) {
    int dp [ N ];
    dp [ 0 ] = 1;
    dp [ 1 ] = 2;
    int i = 2;
    do {
      dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ];
    }
    while ( dp [ i ++ ] <= N );
    return ( i - 2 );
  }