【 CodeFors 877 】 A B

A Div. 64
Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills.

Her problem is following: for given string, consisting of only 0 and 1, tell if it’s possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisible by 64, in the binary numerical system.

Input
In the only line given a non-empty binary string s with length up to 100.

Output
Print «yes» (without quotes) if it’s possible to remove digits required way and «no» otherwise.

Example
Input
100010001
Output
yes
Input
100
Output
no
Note
In the first test case, you can get string 1 000 000 after removing two ones which is a representation of number 64 in the binary numerical system.

You can read more about binary numeral system representation here:
题意 给个100位二进制的数，问能否删除一些数字让其能够被64整除。
分析 ： 我们可以打一下表，将64的倍数都打印出来（用二进制），然后我们就可以看到规律 。
代码

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define first fi
#define second se
#define  LL long long
#define fread() freopen("in.txt","r",stdin)
#define fwrite() freopen("out.txt","w",stdout)
#define CLOSE() ios_base::sync_with_stdio(false)

const int MAXN = 10000;
const int MAXM = 1e6;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;

int main(){
    CLOSE();
//  fread();
//  fwrite();
//  for(int i=64;i<MAXN;i+=64){  //打表代码
//      string s="";
//      int t=i;
//      while(t){
//          s+=t%2+'0';
//          t/=2;
//      }
//      reverse(s.begin(),s.end());
//      cout<<s<<endl;
//  }
    string s;cin>>s;
    int flag=0;
    int cnt=0;int i;
    for(  i=s.size()-1;i>=0;i--) {
        if(s[i]=='0') cnt++;
        if(cnt==6) break;// 首先要有6个0
    }
    for(i;i>=0;i--) {
        if(s[i]=='1') flag=1; // 6个零之后要有一个1
    }
    if(flag)puts("yes");
    else puts("no");
    return 0;
}

B - Cubes for Masha
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.

Example
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个正方体，每个正方体上的每个面都有一个数字，现在我们要找到一个最大的数x，使从1-x的数字都可以用这个n个正方体表示（比方说第一个正方体有个面为5，第二个正方体有个面为1，那么51和15都可以用正方体表示），同时不必将所有的正方体都用上。
分析 ： 暴力。

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define first fi
#define second se
#define  LL long long

const int MAXN = 10;
const int MAXM = 1e6;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;

int arr[MAXN][10];
int main(){
    int n; scanf("%d",&n);
    int sz=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=6;j++){
            scanf("%d",&arr[i][j]);   
         }
     }

    int ans=0; int id=1;  //  从1开始 
    int ge=10000; 
    while(ge--){// 一个数字的情况
        for(int j=1;j<=n;j++){  
            for(int i=1;i<=6;i++){
                if(arr[j][i]==id){
                    ans=id;
                    id++;
                }
            } 
        }
    }
    ge=10000;
    while(ge--){ // 两位数的情况
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(j==i) continue;

                for(int a=1;a<=6;a++){
                    for(int b=1;b<=6;b++){
                        if(arr[i][a]*10+arr[j][b]==id){
                            ans=id;
                            id++;
                          }
                      }
                  } 
              }
          }
      }

    ge=5000;
    while(ge--){//三位数的情况
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i==j) continue;
                for(int k=1;k<=n;k++){
                    if(j==k||k==i) continue;

                    for(int a=1;a<=6;a++){
                        for(int b=1;b<=6;b++){
                            for(int c=1;c<=6;c++) {
                                if(arr[i][a]*100+arr[j][b]*10+arr[k][c]==id) {
                                    ans=id;
                                    id++;
                                }
                            }
                        }
                    }
                }
            }
        }
    }   
    printf("%d\n",ans);
    return 0;
}