Submission #4661395
Source Code Expand
#define _USE_NATH_DEFINES #include<cstdio> #include <iostream> #include<sstream> #include<fstream> #include<iomanip> #include<algorithm> #include<cmath> #include<complex> #include <string> #include<vector> #include<list> #include<queue> #include<stack> #include<set> #include<map> #include<bitset> #include<numeric> #include<limits> #include<climits> #include<cfloat> #include<functional> #include<iterator> #define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i ) #define rep(i,n) REP(i,0,n) using namespace std; int main() { int n; cin >> n; int d[110]; rep(i, n) cin >> d[i]; sort(d,d+n); int ans = 0; rep(i, n) { if (d[i] == d[i + 1]) { ++ans; } } cout << n-ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Kagami Mochi |
User | Custom74 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 747 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |