title: Maximum Games Played Winner
signature: function maximum_games_played_winner(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(73, 8);
      @printf("TEST-0...%s\n",result);
      
      result = driver(28, 6);
      @printf("TEST-1...%s\n",result);
      
      result = driver(33, 6);
      @printf("TEST-2...%s\n",result);
      
      result = driver(23, 6);
      @printf("TEST-3...%s\n",result);
      
      result = driver(84, 8);
      @printf("TEST-4...%s\n",result);
      
      result = driver(31, 6);
      @printf("TEST-5...%s\n",result);
      
      result = driver(48, 7);
      @printf("TEST-6...%s\n",result);
      
      result = driver(46, 7);
      @printf("TEST-7...%s\n",result);
      
      result = driver(45, 7);
      @printf("TEST-8...%s\n",result);
      
      result = driver(90, 9);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
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 );
  }