title: Maximum Games Played Winner
signature: function maximumGamesPlayedWinner($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      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));
      
  }
  
  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 );
  }