Submission #1947030


Source Code Expand

Copy
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<set>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
#define ALL(a) (a).begin(),(a).end()
//#define EVEL 1

#ifdef EVEL
#define DEB(X) cout << #X << ":" <<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {}
#define TF(f) {}
#define END {}
#endif
const int MOD = 1000000007;
const int INF = 2000000000;

    string S,T;
    ll N,ans=0;
    set<int> A;
    bool F=true;
int main(){
    ios_base::sync_with_stdio(false);
    cin>>N;
    REP(i,N){
        int a;
        cin>>a;
        A.insert(a);
    }

    cout<<A.size()<<endl;
    return 0;
}

Submission Info

Submission Time
Task B - Kagami Mochi
User Nafmo2
Language C++14 (GCC 5.4.1)
Score 200
Code Size 959 Byte
Status
Exec Time 2 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 a01, a02, a03
All 200 / 200 a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 2 ms 256 KB
a02 2 ms 256 KB
a03 2 ms 256 KB
b04 2 ms 256 KB
b05 2 ms 256 KB
b06 2 ms 256 KB
b07 2 ms 256 KB
b08 2 ms 256 KB
b09 2 ms 256 KB
b10 2 ms 256 KB
b11 2 ms 256 KB
b12 1 ms 256 KB
b13 1 ms 256 KB