codeforces 887B Cubes for Masha 两种暴力

B. Cubes for Masha

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Absent-minded Masha got set of n cubes for her birthday.

At each of 6 faces of each cube, there is exactly one digit from 0 to 9. Masha became interested what is the largest natural x such she can make using her new cubes all integers from 1 to x.

To make a number Masha can rotate her cubes and put them in a row. After that, she looks at upper faces of cubes from left to right and reads the number.

The number can't contain leading zeros. It's not required to use all cubes to build a number.

Pay attention: Masha can't make digit 6 from digit 9 and vice-versa using cube rotations.

Input

In first line integer n is given (1 ≤ n ≤ 3) — the number of cubes, Masha got for her birthday.

Each of next n lines contains 6 integers aij (0 ≤ aij ≤ 9) — number on j-th face of i-th cube.

Output

Print single integer — maximum number x such Masha can make any integers from 1 to x using her cubes or 0 if Masha can't make even 1.

Examples

input

3
0 1 2 3 4 5
6 7 8 9 0 1
2 3 4 5 6 7

output

87

input

3
0 1 3 5 6 8
1 2 4 5 7 8
2 3 4 6 7 9

output

98

Note

In the first test case, Masha can build all numbers from 1 to 87, but she can't make 88 because there are no two cubes with digit 8.

思路：

暴力模拟，一个数字里面每个骰子有且至多能用一次

 #include <iostream>
 #include <stdio.h>
 #include <string.h>
 using namespace std;
 int weishu(int num) {
     if(num>=&&num<=) return ;
     if(num>=&&num<=) return ;
     if(num>=&&num<=) return ;
     return ;
 }
 bool exist(int ans[][], int rec[], int len) {
     if(len==) {
         int a=rec[];
         if(ans[][a]||ans[][a]||ans[][a]) return true;
     } else if(len==) {
         int a=rec[],b=rec[];
         if((ans[][a]&&ans[][b])
             ||(ans[][a]&&ans[][b])
             ||(ans[][a]&&ans[][b])
             ||(ans[][a]&&ans[][b])
             ||(ans[][a]&&ans[][b])
             ||(ans[][a]&&ans[][b]))
         return true;
     } else if(len==) {
         int a=rec[],b=rec[],c=rec[];
         if((ans[][a]&&ans[][b]&&ans[][c])
             ||(ans[][a]&&ans[][b]&&ans[][c])
             ||(ans[][a]&&ans[][b]&&ans[][c])
             ||(ans[][a]&&ans[][b]&&ans[][c])
             ||(ans[][a]&&ans[][b]&&ans[][c])
             ||(ans[][a]&&ans[][b]&&ans[][c]))
         return true;
     }
     return false;
 }
 int main(){
     int ans[][],n,num,bns[][],rec[];
     memset(ans,,sizeof(ans));
     /*read*/
     scanf("%d",&n);
     for(int i=;i<=n;++i) {
         int flag[]={};
         for(int j=;j<;++j) {
             scanf("%d",&num);
             if(flag[num]==) {
                 ans[i][num]++;
                 flag[num]=;
             }
         }
     }
     /*slove*/
     int result=;
     for(int i=;i<=;++i) {
         if(i==) {
             result=;
             break;
         }
         int len=weishu(i);
         int temp=i;
         memcpy(bns,ans,sizeof(ans));
         memset(rec,-,sizeof(rec));
         for(int j=;j<=len;++j) {
             int r=i%;
             rec[j]=r;
             i=i/;
         }
         i=temp;
         if(!exist(ans,rec,len)) {
             result=i-;
             break;
         }
     }
     printf("%d\n",result);
     return ;
 }

优化暴力模拟，不可能出现比99大的数字，因为如果要出现比99大的数字，那么需要有1 1，2 2，3 3，4 4，5 5，6 6，7 7，8 8，9 9这样的话已经有18个数字，即使三个骰子也只是刚好18个数字。其中必不可少的是数字0，加上就是19。所以不可能出现比99大的数字。

 #include <bits/stdc++.h>
 using namespace std;
 int main() {
     int n,ans[][],vis[];
     memset(vis,,sizeof(vis));
     scanf("%d",&n);
     for(int i=;i<=n;++i) {
         for(int j=;j<=;++j) {
             scanf("%d",&ans[i][j]);
         }
     }
     for(int i=;i<=n;++i) {
         for(int j=;j<=;++j) {
             vis[ans[i][j]]=;
             for(int k=;k<=n;++k) {
                 if(k==i) continue;
                 for(int l=;l<=;++l) {
                     vis[ans[i][j]*+ans[k][l]]=;
                 }
             }
         }
     }
     for(int i=;i<=;++i) {
         if(!vis[i]) {
             printf("%d\n",i-);
             break;
         }
     }
     return ;
 }