Submission #1947396
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" #include <string> using namespace std; //宣言 typedef long long ll; typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; //数値 #define MOD 1000000007 #define INF (1<<20) const double EPS = 1e-10; const double PI = acos(-1.0); //操作 #define FOR(i,a,b) for(int i=a;i<b;++i) #define REP(i,n) FOR(i,0,n) #define REPB(i,n) for(int i=n;i>=0;--i) #define SORT(A) sort(A,A+sizeof(A)/sizeof(A[0])) #define VSORT(A) sort(A.begin(),A.end()) #define EXIST(s,e) (s.find(e)!=s.end()) #define PB push_back #define MP make_pair #define Int(x) int x; scanf("%lld", &x); #define int2(x, y) int x, y; scanf("%lld %lld", &x, &y); //DEBUG //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int main() { int n; cin >> n; int a[101] = { 0 }; for (int i = 0;i < n;i++) { int d; cin >> d; a[d] = 1; } int ans = 0; REP(i, 101) ans += a[i]; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Kagami Mochi |
User | Black__Lotus |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1129 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 |