codeforces 992A Nastya and an Array

http://www.elijahqi.win/archives/3764
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个数

#include<bits/stdc++.h>
using namespace std;
set<int>s;
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;
}