[ZJOI2010]count \u6570\u5b57\u8ba1\u6570<\/p>\n
Time Limit:3000MS Memory Limit:65536K
Total Submit:128 Accepted:63
Case Time Limit:1000MS<\/p>\n
Description <\/strong><\/p>\n \u7ed9\u5b9a\u4e24\u4e2a\u6b63\u6574\u6570a\u548cb\uff0c\u6c42\u5728[a,b]\u4e2d\u7684\u6240\u6709\u6574\u6570\u4e2d\uff0c\u6bcf\u4e2a\u6570\u7801(digit)\u5404\u51fa\u73b0\u4e86\u591a\u5c11\u6b21\u3002 <\/p>\n Input <\/strong><\/p>\n \u8f93\u5165\u6587\u4ef6\u4e2d\u4ec5\u5305\u542b\u4e00\u884c\u4e24\u4e2a\u6574\u6570a\u3001b\uff0c\u542b\u4e49\u5982\u4e0a\u6240\u8ff0\u3002 <\/p>\n Output <\/strong><\/p>\n \u8f93\u51fa\u6587\u4ef6\u4e2d\u5305\u542b\u4e00\u884c10\u4e2a\u6574\u6570\uff0c\u5206\u522b\u8868\u793a0-9\u5728[a,b]\u4e2d\u51fa\u73b0\u4e86\u591a\u5c11\u6b21\u3002 <\/p>\n Sample Input <\/strong><\/p>\n 1 99<\/p>\n Sample Output <\/strong><\/p>\n 9 20 20 20 20 20 20 20 20 20<\/p>\n Hint <\/strong><\/p>\n 30%\u7684\u6570\u636e\u4e2d\uff0ca<=b<=10^6\uff1b Source <\/strong><\/p>\n Day1 #include <vector> [ZJOI2010]count \u6570\u5b57\u8ba1\u6570 Time Limit:3000MS Memory Limit:65536KTotal Submit:128 Accepted:63 Case Time Limit:1000MS Description \u7ed9\u5b9a\u4e24\u4e2a\u6b63\u6574\u6570a\u548cb\uff0c\u6c42\u5728[a,b]\u4e2d\u7684\u6240\u6709\u6574\u6570\u4e2d\uff0c\u6bcf\u4e2a\u6570\u7801(digit)\u5404\u51fa\u73b0\u4e86\u591a\u5c11\u6b21\u3002 Input \u8f93\u5165\u6587\u4ef6\u4e2d\u4ec5\u5305\u542b\u4e00\u884c\u4e24\u4e2a\u6574\u6570a\u3001b\uff0c\u542b\u4e49\u5982\u4e0a\u6240\u8ff0\u3002 Output \u8f93\u51fa\u6587\u4ef6\u4e2d\u5305\u542b\u4e00\u884c10\u4e2a\u6574\u6570\uff0c\u5206\u522b\u8868\u793a0-9\u5728[a,b]\u4e2d\u51fa\u73b0\u4e86\u591a\u5c11\u6b21\u3002 Sample Input 1 99 Sample Output 9 20 20 20 20 20 20 20 20 20 Hint 30%\u7684\u6570\u636e\u4e2d\uff0ca<=b<=10^6\uff1b 100%\u7684\u6570\u636e\u4e2d\uff0ca<=b<=10^12\u3002 Source Day1\u6211\u7684\u5a18\u554a\uff0c\u8fd9\u9898\u641e\u6b7b\u6211\u4e86\u3002\u3002\u6570\u4f4d\u7edf\u8ba1\u771f\u662f\u6076\u5fc3\u56e7\u3002\u3002\u3002\u7b97\u6cd5\u5dee\u4e0d\u591a\u5427\uff0c\u5c31\u662f\u4e00\u4f4d\u4f4d\u7edf\u8ba1\u8fc7\u53bb\uff0c\u6700\u5173\u952e\u7684\u4e00\u70b9\u662f\u5904\u7406\u597d\u7b2c\u4e00\u4f4d\u4e3a0\u7684\u60c5\u51b5\u3002\u3002\u6211\u7684\u529e\u6cd5\u662f\u9996\u5148\u770b\u62100000-9999\u4e4b\u7c7b\u7684\uff0c\u7136\u540e\u51cf\u6389\u591a\u4f59\u76840\u56e7\u3002\u3002 #include <vector>#include <algorithm>#include <utility>#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#define rep(i,n) for(int i=0;i<n;i++)#define pb push_backconst int inf=~0U>>1,maxn=10,maxd=15;using namespace std;typedef […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/265"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=265"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/265\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=265"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=265"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=265"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
100%\u7684\u6570\u636e\u4e2d\uff0ca<=b<=10^12\u3002 <\/p>\n
\u6211\u7684\u5a18\u554a\uff0c\u8fd9\u9898\u641e\u6b7b\u6211\u4e86\u3002\u3002
\u6570\u4f4d\u7edf\u8ba1\u771f\u662f\u6076\u5fc3\u56e7\u3002\u3002\u3002
\u7b97\u6cd5\u5dee\u4e0d\u591a\u5427\uff0c\u5c31\u662f\u4e00\u4f4d\u4f4d\u7edf\u8ba1\u8fc7\u53bb\uff0c\u6700\u5173\u952e\u7684\u4e00\u70b9\u662f\u5904\u7406\u597d\u7b2c\u4e00\u4f4d\u4e3a0\u7684\u60c5\u51b5\u3002\u3002\u6211\u7684\u529e\u6cd5\u662f\u9996\u5148\u770b\u62100000-9999\u4e4b\u7c7b\u7684\uff0c\u7136\u540e\u51cf\u6389\u591a\u4f59\u76840\u56e7\u3002\u3002<\/p>\n
#include <algorithm>
#include <utility>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
const int inf=~0U>>1,maxn=10,maxd=15;
using namespace std;
typedef long long ll;
ll A[maxn],C[maxn],Pow[maxd],Pre[maxn];
int N[maxd],n;
void Dfs(int p)
{
int t=N[p];
if(p<0)
{
rep(j,10)C[j]+=Pre[j];
return;
}
rep(i,t)
{
ll num=Pow[p];
if(p==n-1&&i==0)
{
rep(j,10)C[j]+=num\/10*p;
rep(j,p+1)
{
C[0]-=(Pow[p-j]-Pow[p-j]\/10)*j;
}
}
else
{
Pre[i]++;
rep(j,10)C[j]+=Pre[j]*num;
Pre[i]–;num\/=10;
rep(j,10)C[j]+=p*num;
}
}
Pre[t]++;Dfs(p-1);
}
void Cal(ll x)
{
for(n=0;x;x\/=10,n++)N[n]=x%10;
memset(C,0,sizeof(C));
memset(Pre,0,sizeof(Pre));
Dfs(n-1);
}
int main()
{
\/\/freopen("in","r",stdin);
\/\/freopen("out","w",stdout);
ll a,b;cin>>a>>b;Pow[0]=1;rep(i,maxd-1)Pow[i+1]=Pow[i]*10;
Cal(b);rep(i,10)A[i]=C[i];
Cal(a-1);rep(i,10)A[i]-=C[i];
rep(i,10)cout<<A[i]<<" ";
}<\/p>\n","protected":false},"excerpt":{"rendered":"