Roman Kurnovskii
  • Notes
    • AWS »
      • AWS Developer Associate
    • OS »
      • Docker
      • Linux
      • Mac
    • Programming »
      • Algorithms
      • Hugo
      • JavaScript
      • Python
    • Cheat Sheets
    • Links
  • Roadmaps
    • Algorithms101 »
      • Algorithms
      • Data Structures
      • LeetCode
      • Codeforces
    • AWS Developer Associate
    • Диссертация [RU]
  • Stories
  • Apps
Table of Contents
Algorithms 101
  • Plan
  • LeetCode
    • Easy
      • 1. Two Sum
      • 13. Roman to Integer
      • 14. Longest Common Prefix
      • 20. Valid Parentheses
      • 21. Merge Two Sorted Lists
      • 26. Remove Duplicates from Sorted Array
      • 66. Plus One
      • 69. Sqrt(x)
      • 70. Climbing Stairs
      • 88. Merge Sorted Array
      • 94. Binary Tree Inorder Traversal
      • 141. Linked List Cycle
      • 160. Intersection of Two Linked Lists
    • Medium
      • Other
        • 8. String to Integer (atoi)
        • 134. Gas Station
        • 138. Copy List with Random Pointer
        • 139. Word Break
        • 146. LRU Cache
        • 148. Sort List
      • 2. Add Two Numbers
      • 3. Longest Substring Without Repeating Characters
      • 5. Longest Palindromic Substring
      • 7. Reverse Integer
      • 11. Container With Most Water
      • 15. 3Sum
      • 17. Letter Combinations of a Phone Number
      • 19. Remove Nth Node From End of List
      • 22. Generate Parentheses
      • 28. Find the Index of the First Occurrence in a String
      • 29. Divide Two Integers
      • 33. Search in Rotated Sorted Array
      • 34. Find First and Last Position of Element in Sorted Array
      • 36. Valid Sudoku
      • 38. Count and Say
      • 46. Permutations
      • 48. Rotate Image
      • 49. Group Anagrams
      • 50. Pow(x, n)
      • 53. Maximum Subarray
      • 55. Jump Game
      • 56. Merge Intervals
      • 62. Unique Paths
      • 73. Set Matrix Zeroes
      • 75. Sort Colors
      • 78. Subsets
      • 116. Populating Next Right Pointers in Each Node
      • 122. Best Time to Buy and Sell Stock II
      • 128. Longest Consecutive Sequence
      • 130. Surrounded Regions
      • 131. Palindrome Partitioning
  • Algorithms
  • Data Structures
    • Binary Tree
    • Segment Tree
  • Codeforces
    • Plan
    • Python template for contests
    • 01: Implementation & Greedy
      • 1809A - Garland - 800
      • 1807A - Plus or Minus - 800
      • 1807B - Grab the Candies - 800
      • 1807C - Find and Replace - 800
      • 1798A - Showstopper - 800
      • 1799A - Recent Actions - 800
      • 1788A - One and Two - 800
      • 1778A - Flip Flop Sum - 800
      • 1772A - A+B? - 800
      • 1796B - One and Two - 800
    • 02: Combinatorics & Geometry
      • 1777A - Everybody Likes Good Arrays! - 800
      • 1787A - Exponential Equation - 800
      • 1777B - Emordnilap - 900
      • 1773F - Football - 800
    • Other
      • Round #849/1791 (Div. 4)
      • Round #867/1822 (Div. 3)

1807A - Plus or Minus - 800

Updated: 2023-04-28
1 min read
Algorithms

On This Page

  • Solution

1807A - Plus or Minus (implementation, 800)

Solution

t = int(input())

for _ in range(t):
    a, b, c = map(int, input().split())
    print('+' if a + b == c else '-')
Previous 1809A - Garland - 800
Next 1807B - Grab the Candies - 800

On This Page

  • Solution

Edit this page
Add Github comment

© 2023 Personal page · Subscribe · Hugo · Updated 2023-04-28

Search results