Given an array of integers nums and an integer target, find two distinct indices i and j such that nums[i] + nums[j] == target. Every input has exactly one solution, and you may not use the same element twice.
Input format
Line 1: space-separated integers (the array nums).
Line 2: a single integer target.
Output format
A single line containing two space-separated integers i j (0-indexed) such that i < j and nums[i] + nums[j] == target.
Constraints
- 2 ≤ len(nums) ≤ 100,000
- -10^9 ≤ nums[k] ≤ 10^9
- Exactly one valid pair exists.