#include <bits/stdc++.h>
using namespace std;
int ans(int arr[],int n,int k){
unordered_set<int>m;
for(int i=0;i<n;i++){
int x=k-arr[i];
if(m.find(arr[i])!=m.end()){
return 0;
}
else{
m.insert(arr[i]);
}
}
return -1;
}
int main() {
// your code goes here
int arr[]={1,-2,1,0,5};
int n=sizeof(arr)/sizeof(arr[0]);
int k=0;
if(ans(arr,n,k)==-1){
cout<<"false";
}
else{
cout<<"true";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBhbnMoaW50IGFycltdLGludCBuLGludCBrKXsKCXVub3JkZXJlZF9zZXQ8aW50Pm07Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlpbnQgeD1rLWFycltpXTsKCQlpZihtLmZpbmQoYXJyW2ldKSE9bS5lbmQoKSl7CgkJCXJldHVybiAwOwoJCX0KCQllbHNlewoJCQltLmluc2VydChhcnJbaV0pOwoJCX0KCX0KCXJldHVybiAtMTsKIAp9CmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IGFycltdPXsxLC0yLDEsMCw1fTsKCWludCBuPXNpemVvZihhcnIpL3NpemVvZihhcnJbMF0pOwoJaW50IGs9MDsKIAoJaWYoYW5zKGFycixuLGspPT0tMSl7CgkJY291dDw8ImZhbHNlIjsKCX0KCWVsc2V7CgkJY291dDw8InRydWUiOwoJfQoJcmV0dXJuIDA7Cn0=