Codeforces Round #139 (Div. 2) A. Dice Tower

A. Dice Tower

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A dice is a cube, its faces contain distinct integers from 1 to 6 as black points. The sum of numbers at the opposite dice faces always equals 7. Please note that there are only two dice (these dices are mirror of each other) that satisfy the given constraints (both of them are shown on the picture on the left).

Alice and Bob play dice. Alice has built a tower from n dice. We know that in this tower the adjacent dice contact with faces with distinct numbers. Bob wants to uniquely identify the numbers written on the faces of all dice, from which the tower is built. Unfortunately, Bob is looking at the tower from the face, and so he does not see all the numbers on the faces. Bob sees the number on the top of the tower and the numbers on the two adjacent sides (on the right side of the picture shown what Bob sees).

Help Bob, tell whether it is possible to uniquely identify the numbers on the faces of all the dice in the tower, or not.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — the number of dice in the tower.

The second line contains an integer x (1 ≤ x ≤ 6) — the number Bob sees at the top of the tower. Next n lines contain two space-separated integers each: the i-th line contains numbers ai, bi (1 ≤ ai, bi ≤ 6; ai ≠ bi) — the numbers Bob sees on the two sidelong faces of the i-th dice in the tower.

Consider the dice in the tower indexed from top to bottom from 1 to n. That is, the topmost dice has index 1 (the dice whose top face Bob can see). It is guaranteed that it is possible to make a dice tower that will look as described in the input.

Output

Print "YES" (without the quotes), if it is possible to to uniquely identify the numbers on the faces of all the dice in the tower. If it is impossible, print "NO" (without the quotes).

Sample test(s)

input

3
6
3 2
5 4
2 4

output

YES

input

3
3
2 6
4 1
5 3

output

NO

题意：给你n个正方体，从上往下排列，第一个知道三个面，以下都只知道两个面，另外，每一个面和它相对的面的和为7.求以下几个正方体各面是否都能确定，若能，输出YES，否则输出NO。

    如果只知道两个平面的正方体的这两个平面以及其对立面都没有和第一个的第三个面相等的话，那么这个正方体的各面是可以唯一确定的。不明白可以画图看看。

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
  int n,x,i,j,k;
  int a,b;
    scanf("%d%d",&n,&x);
    scanf("%d%d",&a,&b);
     int flag=0;
    for(i=0;i<n-1;i++)
     {
         scanf("%d%d",&a,&b);
        if(a!=x&&b!=x&&(7-a!=x)&&(7-b!=x))
           continue;
        else
          {
              flag=1;
              break;
          }
     }
    if(flag==1)
       printf("NO\n");
    else
      printf("YES\n");

	return 0;
}