Submission #6419976
Source Code Expand
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
a = [1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1]
x, y = MAP()
if a[x - 1] == a[y - 1]:
print("Yes")
else:
print("No")
Submission Info
Submission Time |
|
Task |
A - Grouping |
User |
keiouok |
Language |
Python (3.4.3) |
Score |
100 |
Code Size |
744 Byte |
Status |
AC |
Exec Time |
37 ms |
Memory |
5148 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 |
37 ms |
5144 KB |
0_01.txt |
AC |
37 ms |
5148 KB |
1_00.txt |
AC |
37 ms |
5144 KB |
1_01.txt |
AC |
37 ms |
5144 KB |
1_02.txt |
AC |
37 ms |
5140 KB |
1_03.txt |
AC |
37 ms |
5144 KB |
1_04.txt |
AC |
37 ms |
5144 KB |