Please sign in first.
Submission #1299884
Source Code Expand
#include <iostream>
#include <chrono>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
int main() {
set<int> a{ 1,3,5,7,8,10,12 };
set<int> b{ 4,6,9,11 };
set<int> c{ 2 };
int x, y;
cin >> x >> y;
if (a.find(x) != a.end() && a.find(y) != a.end()) {
cout << "Yes" << endl;
}
else if (b.find(x) != b.end() && b.find(y) != b.end()) {
cout << "Yes" << endl;
}
else if (c.find(x) != c.end() && c.find(y) != c.end()) {
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | A - Grouping |
| User | dsdsds |
| Language | C++14 (GCC 5.4.1) |
| Score | 100 |
| Code Size | 578 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 256 KiB |
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 KiB |
| 0_01.txt | AC | 1 ms | 256 KiB |
| 1_00.txt | AC | 1 ms | 256 KiB |
| 1_01.txt | AC | 1 ms | 256 KiB |
| 1_02.txt | AC | 1 ms | 256 KiB |
| 1_03.txt | AC | 1 ms | 256 KiB |
| 1_04.txt | AC | 1 ms | 256 KiB |