CodeForces - 887B Cubes for Masha

B. Cubes for Masha
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

题意：有n 个立方体

立方体存在六个面，每个面可能存在整数0-9 。可以利用立方体旋转后排在一起，让数字正面朝上，组成从1到x

x是尽可能大的数

.
可以让立方体排成一行，从左至右读正面朝上的数

数字不能含有前导零

注意：不能翻转数字6，当作9使用，没有必要使用全部的立方体

题目很傻逼，但做法，最开始用if手动排3个数的全排，写的有点傻逼，又看到一个更好的写法了。这个题目，其实最大只能到n-1位数，因为，构成n位数要有11，22，，，，99等n*9个数字，但只有n*6个数字，所以这里最多只能构成2位数。

所以用枚举两个数就行，代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<set>
#include<algorithm>
#include<vector>

using namespace std;
set<int> st;
vector<int> q[5];
int N,a;
int b[5][10];
int solve(){
    for(int i=1;i<=1000;++i){
        if(!st.count(i))
            return i-1;
    }
    return 0;
}
int main(void){
    scanf("%d",&N);
    for(int i=1;i<=N;++i){
        for(int j=1;j<=6;++j){
            scanf("%d",&b[i][j]);
            st.insert(b[i][j]);
        }
    }
    for(int i=1;i<=N;++i){
        for(int j=1;j<=6;++j){
            for(int k=1;k<=N;++k){
                for(int l=1;l<=6;++l){
                    if(i != k){
                        st.insert(b[i][j]*10+b[k][l]);
                        st.insert(b[k][l]*10+b[i][j]);
                    }
                }
            }
        }
    }
    cout << solve() << endl;
    return 0;
}