Submission #2006333
Source Code Expand
#include <iostream> #include <cstring> #include <cstdlib> #include <cmath> #include <algorithm> #include <functional> #include <vector> #include <queue> #include <stack> #include <map> #include <set> #include <bitset> #include <cassert> #include <exception> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int,int> P; #define rep(i,a,n) for(ll i = (a);i < (n);i++) #define per(i,a,n) for(ll i = (a);i > (n);i--) #define lep(i,a,n) for(ll i = (a);i <= (n);i++) #define pel(i,a,n) for(ll i = (a);i >= (n);i--) #define clr(a,b) memset((a),(b),sizeof(a)) #define pb push_back #define mp make_pair #define all(c) (c).begin(),(c).end() #define sz size() #define print(X) cout << (X) << endl const ll INF = 1e+9+7; ll n,m,l; string s,t; ll d[100000],dp[100][100]; int main(){ clr(d,0); rep(i,0,3){ cin >> n; d[n]++; } m = 0; rep(i,0,103){ if(d[i] != 0)m++; } print(m); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoDeer and Paint Cans |
User | shadowlink_0122 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1037 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt |
All | 0_000.txt, 0_001.txt, 1_002.txt, 1_003.txt, 1_004.txt, 1_005.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 1024 KB |
0_001.txt | AC | 1 ms | 1024 KB |
1_002.txt | AC | 1 ms | 1024 KB |
1_003.txt | AC | 1 ms | 1024 KB |
1_004.txt | AC | 1 ms | 1024 KB |
1_005.txt | AC | 2 ms | 1024 KB |