codeforces 992A Nastya and an Array

codeforces 992A Nastya and an Array

​​ Nastya owns too many arrays now, so she wants to delete the least important of them. However, she discovered that this array is magic! Nastya now knows that the array has the following properties:

In one second we can add an arbitrary (possibly negative) integer to all elements of the array that are not equal to zero. When all elements of the array become equal to zero, the array explodes. Nastya is always busy, so she wants to explode the array as fast as possible. Compute the minimum time in which the array can be exploded.

Input The first line contains a single integer n

n (1≤n≤105

1≤n≤105 ) — the size of the array.

The second line contains n

n integers a1,a2,…,an

a1,a2,…,an (−105≤ai≤105

−105≤ai≤105 ) — the elements of the array.

Output Print a single integer — the minimum number of seconds needed to make all elements of the array equal to zero.

统计非0个数

#includeusing namespace std;sets;const int N=1e5+10;int a[N],n;int main(){// freopen("a.in","r",stdin); scanf("%d",&n); for (int i=1;i<=n;++i) {scanf("%d",&a[i]);if (a[i]) s.insert(a[i]);} printf("%d\n",s.size()); return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。