title: Maximum Games Played Winner
signature: func maximumGamesPlayedWinner(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(73, 8)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(28, 6)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(33, 6)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(23, 6)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(84, 8)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(31, 6)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(48, 7)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(46, 7)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(45, 7)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(90, 9)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 );
  }