title: Count Strings Can Formed Using B C Given Constraints 1
signature: countStringsCanFormedUsingBCGivenConstraints1 :: Integer -> Integer
  countStringsCanFormedUsingBCGivenConstraints1 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 (55) (83271) )
  
      printf "TEST-1...%s\n" (driver (36) (23383) )
  
      printf "TEST-2...%s\n" (driver (69) (164359) )
  
      printf "TEST-3...%s\n" (driver (92) (389483) )
  
      printf "TEST-4...%s\n" (driver (73) (194619) )
  
      printf "TEST-5...%s\n" (driver (16) (2073) )
  
      printf "TEST-6...%s\n" (driver (88) (340869) )
  
      printf "TEST-7...%s\n" (driver (19) (3459) )
  
      printf "TEST-8...%s\n" (driver (66) (143848) )
  
      printf "TEST-9...%s\n" (driver (68) (157319) )
  
source_py: def count_strings_can_formed_using_b_c_given_constraints_1(n):
      return ((1 + (n * 2)) + ((n * ((n * n) - 1)) // 2))
source_cpp: int count_strings_can_formed_using_b_c_given_constraints_1(int n) {
    return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 );
  }