#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
bool g(int *t, int n)
{
if ( n == 0 )
return false;
std::sort(t, t + n);
return (t[0] == 1) && // first number must be 1
(t[n-1] == n) && // last must be n
(std::set<int>(t, t+n).size() == n); // all must be unique
}
int main()
{
int arr[] = {1,2,3,4,5,6,7};
std::cout << g(arr, 7);
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c2V0Pgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKYm9vbCBnKGludCAqdCwgaW50IG4pCnsKICAgIGlmICggbiA9PSAwICkgCiAgICAgICByZXR1cm4gZmFsc2U7CiAgICBzdGQ6OnNvcnQodCwgdCArIG4pOwogICAgcmV0dXJuICh0WzBdID09IDEpICYmICAvLyBmaXJzdCBudW1iZXIgbXVzdCBiZSAxCiAgICAgICAgICAgICh0W24tMV0gPT0gbikgJiYgLy8gbGFzdCBtdXN0IGJlIG4KICAgICAgICAgICAgKHN0ZDo6c2V0PGludD4odCwgdCtuKS5zaXplKCkgPT0gbik7IC8vIGFsbCBtdXN0IGJlIHVuaXF1ZQp9CgppbnQgbWFpbigpCnsKICAgaW50IGFycltdID0gezEsMiwzLDQsNSw2LDd9OwogICBzdGQ6OmNvdXQgPDwgZyhhcnIsIDcpOwp9