A

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-8;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int  maxm = 300;
const int turn[4][2] = {{1, 0}, { -1, 0}, {0, 1}, {0, -1}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
ll mod = 3e7;
int num[606];
int main()
{
        int n;
        cin >> n;
        int cur;
        for (int i = 1; i <= n; i++)
        {
                cin >> cur;
                num[cur] = 1;
        }
        int anser = 0;
        for (int i = 1; i <= 600; i++)
        {
                if (num[i])
                {
                        anser++;
                }
        }
        cout << anser << endl;
        return 0;

}
View Code

相关文章:

  • 2021-11-08
  • 2021-11-05
  • 2022-02-04
  • 2021-12-03
  • 2021-10-05
  • 2021-12-13
  • 2021-07-24
  • 2021-12-04
猜你喜欢
  • 2021-08-19
  • 2022-01-16
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-05-20
  • 2022-01-04
相关资源
相似解决方案