1 #include<bits/stdc++.h>
2
3 using namespace std ;
4
5 int main()
6 {
7 int a[4][4] = {
8 {1,2,8,9},
9 {2,4,9,12},
10 {4,7,10,13},
11 {6,8,11,15},
12 } ;
13 int n ;
14 cin >> n ; // 要查找的元素
15 int i=0 ;
16 int j=3 ;
17 while((i<=3)&&(j>=0)){
18 if(a[i][j]>n){
19 j-- ;
20 }else if(a[i][j]<n){
21 i++ ;
22 }else if(a[i][j]==n){
23 cout << "yes" <<endl ;
24 break ;
25 }
26 }
27 return 0 ;
28 }
1 import java.util.Scanner;
2
3 public class Find {
4 public static void main(String[] args) {
5 int a[][] = {
6 {1, 2, 8, 9},
7 {2, 4, 9, 12},
8 {4, 7, 10, 13},
9 {6, 8, 11, 15},
10 };
11 int n ;
12 Scanner cin = new Scanner(System.in) ;
13 n = cin.nextInt() ;
14 int i=0 ;
15 int j=a.length - 1;
16 while((i<=3)&&(j>=0)){
17 if(a[i][j]>n){
18 j-- ;
19 }else if(a[i][j]<n){
20 i++ ;
21 }else if(a[i][j]==n){
22 System.out.println("yes");
23 break ;
24 }
25 }
26 }
27 }