title: Count Strings Can Formed Using B C Given Constraints 1
signature: countStringsCanFormedUsingBCGivenConstraints1(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          55, 
          83271)
      }");
  
      print("TEST-1...${driver(
          36, 
          23383)
      }");
  
      print("TEST-2...${driver(
          69, 
          164359)
      }");
  
      print("TEST-3...${driver(
          92, 
          389483)
      }");
  
      print("TEST-4...${driver(
          73, 
          194619)
      }");
  
      print("TEST-5...${driver(
          16, 
          2073)
      }");
  
      print("TEST-6...${driver(
          88, 
          340869)
      }");
  
      print("TEST-7...${driver(
          19, 
          3459)
      }");
  
      print("TEST-8...${driver(
          66, 
          143848)
      }");
  
      print("TEST-9...${driver(
          68, 
          157319)
      }");
  
      return 0;
  }
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 );
  }