/*Write a program to take an integer array nums which contains only positive integers, and an integer target as 
inputs. The goal is to find two distinct indices i and j in the array such that nums[i] + nums[j] equals the
target. Assume exactly one solution exists and return the indices in any order. Print the two indices separated 
by a space as output. If no solution exists, print "-1 -1".*/
#include <stdio.h>
 
int main() {
    int n, target;
    scanf("%d", &n);
 
    int nums[n];
    for (int i = 0; i < n; i++)
        scanf("%d", &nums[i]);
 
    scanf("%d", &target);
 
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (nums[i] + nums[j] == target) {
                printf("%d %d", i, j);
                return 0;
            }
        }
    }
 
    printf("-1 -1");
    return 0;
}
 
 

LypXcml0ZSBhIHByb2dyYW0gdG8gdGFrZSBhbiBpbnRlZ2VyIGFycmF5IG51bXMgd2hpY2ggY29udGFpbnMgb25seSBwb3NpdGl2ZSBpbnRlZ2VycywgYW5kIGFuIGludGVnZXIgdGFyZ2V0IGFzIAppbnB1dHMuIFRoZSBnb2FsIGlzIHRvIGZpbmQgdHdvIGRpc3RpbmN0IGluZGljZXMgaSBhbmQgaiBpbiB0aGUgYXJyYXkgc3VjaCB0aGF0IG51bXNbaV0gKyBudW1zW2pdIGVxdWFscyB0aGUKdGFyZ2V0LiBBc3N1bWUgZXhhY3RseSBvbmUgc29sdXRpb24gZXhpc3RzIGFuZCByZXR1cm4gdGhlIGluZGljZXMgaW4gYW55IG9yZGVyLiBQcmludCB0aGUgdHdvIGluZGljZXMgc2VwYXJhdGVkIApieSBhIHNwYWNlIGFzIG91dHB1dC4gSWYgbm8gc29sdXRpb24gZXhpc3RzLCBwcmludCAiLTEgLTEiLiovCiNpbmNsdWRlIDxzdGRpby5oPgoKaW50IG1haW4oKSB7CiAgICBpbnQgbiwgdGFyZ2V0OwogICAgc2NhbmYoIiVkIiwgJm4pOwoKICAgIGludCBudW1zW25dOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspCiAgICAgICAgc2NhbmYoIiVkIiwgJm51bXNbaV0pOwoKICAgIHNjYW5mKCIlZCIsICZ0YXJnZXQpOwoKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgZm9yIChpbnQgaiA9IGkgKyAxOyBqIDwgbjsgaisrKSB7CiAgICAgICAgICAgIGlmIChudW1zW2ldICsgbnVtc1tqXSA9PSB0YXJnZXQpIHsKICAgICAgICAgICAgICAgIHByaW50ZigiJWQgJWQiLCBpLCBqKTsKICAgICAgICAgICAgICAgIHJldHVybiAwOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQoKICAgIHByaW50ZigiLTEgLTEiKTsKICAgIHJldHVybiAwOwp9Cgo=

NQoyIDcgMTEgMTUgMwo5Cg==

5
2 7 11 15 3
9