title: Program Binary Decimal Conversion 1
signature: def program_binary_decimal_conversion_1(n):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver("uEmIAgF", 0)
      print(f"TEST-0...{result}")
  
      result = driver("753310137", 20)
      print(f"TEST-1...{result}")
  
      result = driver("010011010", 154)
      print(f"TEST-2...{result}")
  
      result = driver("kNi", 0)
      print(f"TEST-3...{result}")
  
      result = driver("04562016903312", 130)
      print(f"TEST-4...{result}")
  
      result = driver("000111101", 61)
      print(f"TEST-5...{result}")
  
      result = driver("bk", 0)
      print(f"TEST-6...{result}")
  
      result = driver("9", 0)
      print(f"TEST-7...{result}")
  
      result = driver("1", 1)
      print(f"TEST-8...{result}")
  
      result = driver("XxT nXLlk", 0)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
source_py: def program_binary_decimal_conversion_1(n):
      num = n
      dec_value = 0
      base1 = 1
      len1 = len(num)
      for i in range((len1 - 1), (- 1), (- 1)):
          if (num[i] == '1'):
              dec_value += base1
          base1 = (base1 * 2)
      return dec_value
source_cpp: int program_binary_decimal_conversion_1(string n) {
    string num = n;
    int dec_value = 0;
    int base = 1;
    int len = num . length ( );
    for ( int i = len - 1;
    i >= 0;
    i -- ) {
      if ( num [ i ] == '1' ) dec_value += base;
      base = base * 2;
    }
    return dec_value;
  }