Submission #1947381

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#define ll long long
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
ll read()
{
	ll tmp=0; char f=1,c=getchar();
	while(c<'0'||'9'<c){if(c=='-')f=-1; c=getchar();}
	while('0'<=c&&c<='9'){tmp=tmp*10+c-'0'; c=getchar();}
	return tmp*f;
}
using namespace std;
int cnt[110];
int n;
int main()
{
	n=read();
	for(int i=1;i<=n;i++)++cnt[read()];
	int ans=0;
	for(int i=1;i<=100;i++)if(cnt[i])++ans;
	printf("%d\n",ans);
	return 0;
}

Submission Info

Judge Result