Point at Origin
Programming Basics · C++
TASK
Problem
In “Point at Origin”, solve the stated coordinate or interval relation using integer comparisons.
EXAMPLE
Example
0 5
NO
LIMITS
Constraints
Coordinate magnitudes are at most 10^9; interval endpoints are given in nondecreasing order.
LEARN
Theory for this problem
+
Coordinate tasks often reduce to comparisons, absolute differences, `min`, and `max`.
Connection to “Point at Origin”: here, intermediate values are best kept in named variables so the formula stays readable and data types remain clear.
NEED HELP?
Hints
+
['Translate the geometry into inequalities before coding.', 'After solving “Point at Origin”, verify the algorithm on your own small example and on an allowed boundary case. Print only the required result with no extra text.']
ANSWER
Solution
+
#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
cout << ((x == 0 && y == 0) ? "YES" : "NO") << '\n';
return 0;
}