title: Triangular Numbers 1
signature: triangularNumbers1(num) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(num, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(num), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          1, 
          true)
      }");
  
      print("TEST-1...${driver(
          3, 
          true)
      }");
  
      print("TEST-2...${driver(
          6, 
          true)
      }");
  
      print("TEST-3...${driver(
          10, 
          true)
      }");
  
      print("TEST-4...${driver(
          55, 
          true)
      }");
  
      print("TEST-5...${driver(
          48, 
          false)
      }");
  
      print("TEST-6...${driver(
          63, 
          false)
      }");
  
      print("TEST-7...${driver(
          72, 
          false)
      }");
  
      print("TEST-8...${driver(
          16, 
          false)
      }");
  
      print("TEST-9...${driver(
          85, 
          false)
      }");
  
      return 0;
  }
source_py: def triangular_numbers_1(num):
      if (num < 0):
          return False
      c = ((- 2) * num)
      (b, a) = (1, 1)
      d = ((b * b) - ((4 * a) * c))
      if (d < 0):
          return False
      root1 = (((- b) + math.sqrt(d)) / (2 * a))
      root2 = (((- b) - math.sqrt(d)) / (2 * a))
      if ((root1 > 0) and (math.floor(root1) == root1)):
          return True
      if ((root2 > 0) and (math.floor(root2) == root2)):
          return True
      return False
source_cpp: bool triangular_numbers_1(int num) {
    if ( num < 0 ) return false;
    int c = ( - 2 * num );
    int b = 1, a = 1;
    int d = ( b * b ) - ( 4 * a * c );
    if ( d < 0 ) return false;
    float root1 = ( - b + sqrt ( d ) ) / ( 2 * a );
    float root2 = ( - b - sqrt ( d ) ) / ( 2 * a );
    if ( root1 > 0 && floor ( root1 ) == root1 ) return true;
    if ( root2 > 0 && floor ( root2 ) == root2 ) return true;
    return false;
  }