def generate_bf_code(number):
num_digits = int (len(str(number)))
bf_code = ""
if num_digits == 1:
for i in range(number+48):
bf_code += '+'
bf_code += '.'
print(bf_code)
elif num_digits == 2:
number1 = int(number/10)
for i in range(number1+48):
bf_code += '+'
bf_code += ".>"
print(bf_code)
bf_code = ""
number2 = int(number%10)
for i in range(number2+48):
bf_code += '+'
bf_code += '.'
print(bf_code)
else:
number1 = int(number/100)
for i in range(number1+48):
bf_code += '+'
bf_code += ".>"
print(bf_code)
bf_code = ""
number2 = int((number/10)%10)
for i in range(number2+48):
bf_code += '+'
bf_code += '.>'
print(bf_code)
bf_code = ""
number3 = int(number%10)
for i in range(number3+48):
bf_code += '+'
bf_code += '.'
print(bf_code)
expression = input()
result = int (eval(expression))
bf_code = generate_bf_code(result)
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |