codeforces-330-Pasha and Phone(容差定理)
2015-11-09 13:34
337 查看
B. Pasha and Phone
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 c1·10k - 1 + c2·10k - 2 + ... + 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 test(s)
input
output
input
output
Note
In the first test sample good phone numbers are: 000000, 000098, 005600, 005698, 380000, 380098, 385600, 385698.
思路:
这题出的非常好,挺考思维的。我们一开始用暴力去做题的话会TLE,但是之后就会想到要用最大的那个数去除a【i】,之后就不知道如何去求第一位是吧【i】的且能被啊【i】整除的数。其实这个也与第一个相同,只是第一个是0 - max的范围,而第二个就是b【i】99999 - 99999的范围(上面例子m为7),所以只要在这个范围内求出吧【i】99999/a[i]有多少个数符合,然后再加上减多了的99999/a[i]的个数就将以b[i]开头的且能被a[i]整除的数算出来了。巧妙~
AC代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef unsigned __int64 ll;
#define T 100005
#define mod 1000000007
ll Table[15];
ll a[T],b[T];
void play_table()
{
Table[0] = 1;
Table[1] = 10;
ll i=2;
while(i<=10)
{
Table[i] = Table[i-1]*10;
i++;
}
}
int main()
{
#ifdef zsc
freopen("input.txt","r",stdin);
#endif
ll n,m,i,k,j,bit;
play_table();
while(~scanf("%I64d%I64d",&n,&m))
{
bit = n/m;
for(i=0;i<bit;++i){
scanf("%I64d",&a[i]);
b[i] = 0;
}
for(i=0;i<bit;++i){
scanf("%I64d",&k);
ll tmp = (Table[m]-1)/a[i];
if(k!=0){
ll t1=k,t2=k-1;
for(j=0;j<m-1;++j){
t1 = (t1*10)+9;
t2 = (t2*10)+9;
}
b[i] = tmp - t1/a[i] + t2/a[i] + 1;
}
else
{
b[i] = tmp - (Table[m-1]-1)/a[i];
}
}
ll ans=1;
for(i=0;i<bit;++i){
ans = (ans*b[i])%mod;
}
printf("%I64d\n",ans);
}
return 0;
}
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 c1·10k - 1 + c2·10k - 2 + ... + 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 test(s)
input
6 2 38 56 49 7 3 4
output
8
input
8 2 1 22 3 44 5 4 3 2
output
32400
Note
In the first test sample good phone numbers are: 000000, 000098, 005600, 005698, 380000, 380098, 385600, 385698.
思路:
这题出的非常好,挺考思维的。我们一开始用暴力去做题的话会TLE,但是之后就会想到要用最大的那个数去除a【i】,之后就不知道如何去求第一位是吧【i】的且能被啊【i】整除的数。其实这个也与第一个相同,只是第一个是0 - max的范围,而第二个就是b【i】99999 - 99999的范围(上面例子m为7),所以只要在这个范围内求出吧【i】99999/a[i]有多少个数符合,然后再加上减多了的99999/a[i]的个数就将以b[i]开头的且能被a[i]整除的数算出来了。巧妙~
AC代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef unsigned __int64 ll;
#define T 100005
#define mod 1000000007
ll Table[15];
ll a[T],b[T];
void play_table()
{
Table[0] = 1;
Table[1] = 10;
ll i=2;
while(i<=10)
{
Table[i] = Table[i-1]*10;
i++;
}
}
int main()
{
#ifdef zsc
freopen("input.txt","r",stdin);
#endif
ll n,m,i,k,j,bit;
play_table();
while(~scanf("%I64d%I64d",&n,&m))
{
bit = n/m;
for(i=0;i<bit;++i){
scanf("%I64d",&a[i]);
b[i] = 0;
}
for(i=0;i<bit;++i){
scanf("%I64d",&k);
ll tmp = (Table[m]-1)/a[i];
if(k!=0){
ll t1=k,t2=k-1;
for(j=0;j<m-1;++j){
t1 = (t1*10)+9;
t2 = (t2*10)+9;
}
b[i] = tmp - t1/a[i] + t2/a[i] + 1;
}
else
{
b[i] = tmp - (Table[m-1]-1)/a[i];
}
}
ll ans=1;
for(i=0;i<bit;++i){
ans = (ans*b[i])%mod;
}
printf("%I64d\n",ans);
}
return 0;
}
相关文章推荐
- 用批处理解决数学问题的代码第1/4页
- Transformation 能将 Windows XP/Server 2003 操作系统,完美地模拟成 Windows Vista 的软件
- 用javascript和css模拟select的脚本
- PHP模拟asp.net的StringBuilder类实现方法
- javascript用层模拟可移动的小窗口
- 自编jQuery插件实现模拟alert和confirm
- PHP模拟asp中response类实现方法
- 模拟Spring的简单实现
- javascript 模拟点击广告
- JQuery中模拟image的ajaxPrefilter与ajaxTransport处理
- php实现模拟post请求用法实例
- JavaScript实现MIPS乘法模拟的方法
- 模拟xcopy的函数
- JS模拟实现Select效果代码
- php模拟服务器实现autoindex效果的方法
- C# SendInput 模拟鼠标操作的实现方法
- PHP模拟登陆163邮箱发邮件及获取通讯录列表的方法
- php常用数学函数汇总
- JS模拟并美化的表单控件完整实例
- php模拟登陆的实现方法分析