Function and Function

If we define , do you know what function  means?

Actually,  calculates the total number of enclosed areas produced by each digit in . The following table shows the number of enclosed areas produced by each digit:

Digit	Enclosed Area	Digit	Enclosed Area
0	1	5	0
1	0	6	1
2	0	7	0
3	0	8	2
4	1	9	1

For example, , and .

We now define a recursive function  by the following equations:

 

For example, , and .

Given two integers  and , please calculate the value of .

Input

There are multiple test cases. The first line of the input contains an integer  (about ), indicating the number of test cases. For each test case:

The first and only line contains two integers and  (). Positive integers are given without leading zeros, and zero is given with exactly one '0'.

<h4< dd="">Output

For each test case output one line containing one integer, indicating the value of .

<h4< dd="">Sample Input

6
123456789 1
888888888 1
888888888 2
888888888 999999999
98640 12345
1000000000 0

<h4< dd="">Sample Output

5
18
2
0
0
1000000000

这道题看第一眼，很容易想到暴力，然后就零分了。

不过仔细观察

观察一下0-9对应的值，很容易发现他们最后都指向了0，1

其余的数同理，最后都会指向1.0；

而0，1的值又是相互对应的。

我们就可以优化了--------------------

链接：不知道

---------------------------

 #include<iostream>
 #include<cstdio>
 using namespace std;
 int n;
 const long long   maxn=1e6;
 int head;
 int x;
 int k;
 int deal1(int  x);
 long long  f[maxn]={,,,,,,,,,};
 void deal(int k,int x){
     while(x>=&&k){
 //        cout<<"d"<<x<<endl;
         x=deal1(x);
         k--;
     }
 //    cout<<x<<endl
     if(!k)
     {
         cout<<x<<endl;
         return ;
     }
     if(k%)
     printf("%d\n",(!x));
     else
     printf("%d\n",x);
     return ;
 }

 int deal1(int  x){
         int  ans=;
         long long now;
         while(x){
             now=x%;
             x/=;
             ans+=f[now];
             //cout<<now<<"dfsd"<<endl;
         }
     return ans;
 }
 int main(){
     scanf("%d",&n);
     for(int i=;i<=n;++i){
         scanf("%d%d",&x,&k);
         if(k==){
             printf("%d\n",x);
         }
         else
         deal(k,x);
     }
     return ;
 } 

Ac