# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14059 | pl0892029 | 이상한 수열 (OJUZ10_bizarre) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <unordered_set>
int arr[50505];
int main()
{
int n, m;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
scanf("%d", &arr[i]);
}
scanf("%d", &m);
if (m <= n)
{
printf("%d", arr[m]);
}
else
{
std::unordered_set<int> nSet;
for (int i = 1; i <= n; ++i)
{
nSet.insert(arr[i]);
}
for (int i = n + 1; i < m; ++i)
{
nSet.insert(nSet.size());
}
printf("%d", nSet.size());
}
}