codeforces 686C C. Robbers' watch(dfs)

题目链接：

C. Robbers' watch

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Robbers, who attacked the Gerda's cab, are very successful in covering from the kingdom police. To make the goal of catching them even harder, they use their own watches.

First, as they know that kingdom police is bad at math, robbers use the positional numeral system with base 7. Second, they divide one day in n hours, and each hour in m minutes. Personal watches of each robber are divided in two parts: first of them has the smallest possible number of places that is necessary to display any integer from 0 to n - 1, while the second has the smallest possible number of places that is necessary to display any integer from 0 to m - 1. Finally, if some value of hours or minutes can be displayed using less number of places in base 7 than this watches have, the required number of zeroes is added at the beginning of notation.

Note that to display number 0 section of the watches is required to have at least one place.

Little robber wants to know the number of moments of time (particular values of hours and minutes), such that all digits displayed on the watches are distinct. Help her calculate this number.

 

Input

 

The first line of the input contains two integers, given in the decimal notation, n and m (1 ≤ n, m ≤ 109) — the number of hours in one day and the number of minutes in one hour, respectively.

 

Output

 

Print one integer in decimal notation — the number of different pairs of hour and minute, such that all digits displayed on the watches are distinct.

 

Examples

 

input

2 3

output

4

input

8 2

output

5

题意：

每天n小时,每小时m分钟,现在给你一个7进制的表,问出现的所有的时间中数字全不相同的时间有多少个;

思路：

先找出表上有多少位数字,再按位dfs,看最后得到的数是否<n和<m,计数就好;

AC代码：

//#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <cstring>
#include <algorithm>
#include <cstdio>

using namespace std;
#define Riep(n) for(int i=1;i<=n;i++)
#define Riop(n) for(int i=0;i<n;i++)
#define Rjep(n) for(int j=1;j<=n;j++)
#define Rjop(n) for(int j=0;j<n;j++)
#define mst(ss,b) memset(ss,b,sizeof(ss));
typedef long long LL;
template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<''||CH>'';F= CH=='-',CH=getchar());
    for(num=;CH>=''&&CH<='';num=num*+CH-'',CH=getchar());
    F && (num=-num);
}
int stk[], tp;
template<class T> inline void print(T p) {
    if(!p) { puts(""); return; }
    while(p) stk[++ tp] = p%, p/=;
    while(tp) putchar(stk[tp--] + '');
    putchar('\n');
}

const LL mod=1e9+;
const double PI=acos(-1.0);
const LL inf=1e18;
const int N=(<<)+;
const int maxn=;

LL n,m,ans=;
int a[],b[],cnt1=,cnt2=,vis[];
LL fn,fm;
LL p[];

void DFS2(int po,LL num)
{
    if(po>cnt2)
    {
        if(num<fm)ans++;
        return ;
    }
    for(int i=;i<;i++)
    {
        if(!vis[i])
        {
            vis[i]=;
            DFS2(po+,num+(LL)i*p[po]);
            vis[i]=;
        }
    }

}

void DFS1(int po,LL num)
{
    if(po>cnt1)
    {
        if(num<fn){DFS2(,);}
        return ;
    }
    for(int i=;i<;i++)
    {
        if(!vis[i])
        {
            vis[i]=;
            DFS1(po+,num+(LL)i*p[po]);
            vis[i]=;
        }
    }
}

int main()
{
            read(n);read(m);
            fn=n,fm=m;
            if(n>)n--;
            if(m>)m--;
            LL w=;
            for(int i=;i<;i++)
            {
                p[i]=w;
                w=w*;
            }
            while(n)
            {
                a[++cnt1]=n%;
                n/=;
            }
            while(m)
            {
                b[++cnt2]=m%;
                m/=;
            }
            mst(vis,);
            ans=;
            DFS1(,);
            cout<<ans<<"\n";
        return ;
}