CodeForces 595B Pasha and Phone

原创 2016年06月01日 10:31:12

CodeForces 595B Pasha and Phone

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Description

Pasha has recently bought a new phone jPager and started adding his friends’ phone numbers there. Each phone number consists of exactly n digits.

Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1,a2,...,an/k and b1,b2,...,bn/k. Let’s split the phone number into blocks of length k. The first block will be formed by digits from the phone number that are on positions 1, 2,…, k, the second block will be formed by digits from the phone number that are on positions k + 1, k + 2, …, 2·k and so on. Pasha considers a phone number good, if the i-th block doesn’t start from the digit bi and is divisible by ai if represented as an integer.

To represent the block of length k as an integer, let’s write it out as a sequence c1, c2,…,ck. Then the integer is calculated as the result of the expression c110k1+c210k2+ck.

Pasha asks you to calculate the number of good phone numbers of length n, for the given k, ai and bi. As this number can be too big, print it modulo 109+7.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ min(n, 9)) — the length of all phone numbers and the length of each block, respectively. It is guaranteed that n is divisible by k.

The second line of the input contains n / k space-separated positive integers — sequence a1,a2,...,an/k (1 ≤ ai< 10k).

The third line of the input contains n / k space-separated positive integers — sequence b1,b2,...,bn/k (0 ≤bi ≤ 9).

Output

Print a single integer — the number of good phone numbers of length n modulo 109+7.

Sample Input

Input

6 2
38 56 49
7 3 4

Output

8

Input

8 2
1 22 3 44
5 4 3 2

Output

32400

Hint

In the first test sample good phone numbers are: 000000, 000098, 005600, 005698, 380000, 380098, 385600, 385698

链接在这: 题目链接


题意:求n位且满足以下两点的号码数量

把号码分成k份(可能以0开头)
1. 第i份是ai的倍数;
2. 第i份不能是以bi开头的数;

按份for循环找一遍,再取模相乘
注意讨论bi是否为0,pow有误差。

代码:

#include<stdio.h>
#define mod 1000000007
int a[100005];
int b[100005];
int ans[100005];
long long mypow(int a,int b)
{
    long long ans=1;
    for(int i=0; i<b; i++)
        ans*=10;
    return ans;
}
int main()
{
    int n,k;
    while(~scanf("%d %d",&n,&k))
    {
        for(int i=0; i<n/k; i++)
            scanf("%d",&a[i]);
        for(int i=0; i<n/k; i++)
            scanf("%d",&b[i]);
        for(int i=0; i<n/k; i++)
        {
            if(b[i]==0)
            {
                ans[i]+=((mypow(10,k)-1)/a[i])+1;
                ans[i]-=(mypow(10,k-1)-1)/a[i]+1;
            }
            else
            {
                ans[i]+=((mypow(10,k)-1)/a[i])+1;
                ans[i]-=(mypow(10,k-1)*(b[i]+1)-1)/a[i]-(mypow(10,k-1)*(b[i])-1)/a[i];
            }
        }
        long long ans2=1;
        for(int i=0; i<n/k; i++)
        {
            ans2*=ans[i];
            ans2%=mod;
        }
        printf("%lld\n",ans2);
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Codeforces 595 B. Pasha and Phone【数学】

B. Pasha and Phone time limit per test 1 second memory limit per test 256 megabytes input stan...

【Codeforces Round 330 (Div 2)B】【数值统计 端点思维】Pasha and Phone 电话号码 每块数是x倍数却不能以y开头方案数

B. Pasha and Phone time limit per test 1 second memory limit per test 256 megabytes ...

Codeforces Round #297 (Div. 2) B. Pasha and String 解题报告

Codeforces Round #297 (Div. 2)   B. Pasha and String 解题报告   题目分类:贪心策略   题目描述:给一个长度为N(2)的字符串,有M...

Codeforces Round #297 (Div. 2)B Pasha and String

ai和s+1-ai是对称的,所以反转偶数次的相当于没翻转,奇数次的要翻转,所以我们只要统计每个字母翻转的次数,用前缀和处理。

Codeforces 557B Pasha and Tea【二分+思维】

Test.

CodeForces 557B-Pasha and Tea【模拟】

Pasha decided to invite his friends to a tea party. For that occasion, he has a large teapot with th...

contest: Codeforces Round #297 (Div. 2), problem: (B) Pasha and String

contest: Codeforces Round #297 (Div. 2), problem: (B) Pasha and String Pasha got a very beautiful st...

Codeforces#297 B Pasha and Strini

题意:给一个字符串,交换m次,每次交换a[i]~n-a[i]+1的字符(例如a[i]=2,n-5,则s[2]和s[4]换)。 思路:暴力时间复杂度是10^5*10^5,pass。在交换中,我们可以先把...

Codeforces_round297_B.Pasha and String

英文原题 Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin ...

codeforces-525B Pasha and String

codeforces-525B Pasha and String
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)