Submission #3025828
Source Code Expand
#include<iostream> #include<algorithm> #include<string> #include<functional> #include<utility> #include<stack> #include<queue> #include<cmath> #include<list> #include<cstdint> #include<vector> #include<map> #define EPS (1e-7) #define INF (1e9) #define PI (acos(-1)) #define rep(i,rept) for(ll i = 0; i<rept;i++) typedef long long ll; ll nCr(ll n, ll r) { if (r > n) { return 0; } if (r * 2 > n) r = n - r; ll dividend = 1; ll divisor = 1; for (ll i = 1; i <= r; ++i) { dividend *= (n - i + 1); divisor *= i; } return dividend / divisor; } ll sumdigit(ll n) { ll dig = 0, sum = 0; while (n) { dig = n % 10; sum = sum + dig; n = n / 10; } return sum; } int main() { const int group[12] = { 0,2,0,1,0,1,0,0,1,0,1,0 }; int x, y; std::cin >> x >> y; if (group[x - 1] == group[y - 1]) { std::cout << "Yes" << std::endl; } else { std::cout << "No" << std::endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - Grouping |
User | hinamel |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 945 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt |
All | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |