# Codeforces327C Magic Five[组合数学]

C. Magic Five
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

There is a long plate s containing n digits. Iahub wants to delete some digits (possibly none, but he is not allowed to delete all the digits) to form his "magic number" on the plate, a number that is divisible by 5. Note that, the resulting number may contain leading zeros.

Now Iahub wants to count the number of ways he can obtain magic number, modulo 1000000007 (109 + 7). Two ways are different, if the set of deleted positions in s differs.

Look at the input part of the statement, s is given in a special form.

Input

In the first line you're given a string a (1 ≤ |a| ≤ 105), containing digits only. In the second line you're given an integer k (1 ≤ k ≤ 109). The plate s is formed by concatenating k copies of a together. That is n = |ak.

Output

Print a single integer — the required number of ways modulo 1000000007 (109 + 7).

Examples
input
1256
1

output
4

input
13990
2

output
528

input
555
2

output
63

Note

In the first case, there are four possible ways to make a number that is divisible by 5: 5, 15, 25 and 125.

In the second case, remember to concatenate the copies of a. The actual plate is 1399013990.

In the third case, except deleting all digits, any choice will do. Therefore there are 26 - 1 = 63 possible ways to delete digits.

#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
const int N=1e5+5;
const int mod=1e9+7;
char sen[N];
int k;
ll Pow(ll n,ll m)
{
ll ans=1;
while (m)
{
if (m&1)
ans=ans*n%mod;
n=n*n%mod;
m>>=1;
}
return ans;
}
int main()
{
while (~scanf("%s",sen))
{
scanf("%d",&k);
int len=strlen(sen);
ll q=Pow(2,len);
ll ans=0;
ll now=1;
for (int i=0 ; i<len ; ++i)
{
if (sen[i]=='0' || sen[i]=='5')
ans=(ans+now*((Pow(q,k)-1+mod)%mod)%mod*Pow((q-1+mod)%mod,mod-2)%mod)%mod;

now=now*2%mod;
}
printf("%I64d\n",ans);
}
return 0;
}


• 评论

• 上一篇
• 下一篇