Submission #3442239
Source Code Expand
#include<iostream> #include <string> #include<algorithm> #include <set> using namespace std; int main(void){ ios::sync_with_stdio(false); int N,i,j,k; cin >> N; int d[N]; for (i = 0; i < N; i++) cin >> d[i]; sort(d, d + N, greater<int>()); j = 0; k = 0; for (i = 0; i < N-1; i++) { if (d[i] != d[i + 1]) j++; } cout << j << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Kagami Mochi |
User | umekaeru |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 380 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
a02 | WA | 1 ms | 256 KB |
a03 | WA | 1 ms | 256 KB |
b04 | WA | 1 ms | 256 KB |
b05 | WA | 1 ms | 256 KB |
b06 | WA | 1 ms | 256 KB |
b07 | WA | 1 ms | 256 KB |
b08 | WA | 1 ms | 256 KB |
b09 | WA | 1 ms | 256 KB |
b10 | WA | 1 ms | 256 KB |
b11 | WA | 1 ms | 256 KB |
b12 | WA | 1 ms | 256 KB |
b13 | WA | 1 ms | 256 KB |