AtCoder Beginner Contest 240 B

先看题面

In a sequence of N positive integers a=(a 1 ,a 2,…,a N ), how many different integers are there?
Constraints
1≤N≤1000
1≤a
i ≤10^9(1≤i≤N)
All values in input are integers.
大意就是a[]中有多少个连续的整数
就循环，每个遍历一次，再用cnt计数就行了
代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXN 1010
#define MAXLEN 21
int main(){ 
    int a[MAXN], n;
    while(scanf("%d", &n) == 1){
        for (inti=0;i<n;i++)
            scanf("%d", a+i);
        sort(a,a+n);
        int cnt=0,last=-1;
        for(int i=0;i<n;i++){
            if(last!=a[i])
                cnt++;
            last=a[i];
        }
        cout<<cnt<<endl;
    }
}