Pagini recente » Cod sursa (job #52983) | Cod sursa (job #813246) | Cod sursa (job #1030327) | Cod sursa (job #548958)
Cod sursa(job #548958)
#include <fstream>
#include <cstdio>
using namespace std;
int v[10][10],a,b,k,C;
ifstream in("cifre.in");
int inv(int x)
{
int q;
for (q=0;x;q=q*10+x%10,x/=10);
return q;
}
int ncif(int x)
{
int p;
for (p=0;x;x/=10,p++);
return p;
}
inline int max(int a,int b)
{
return a>b ? a:b;
}
int nr(int x)
{
int rez=0,nr=C,q=ncif(x)-1;
for (x=inv(x);x;x/=10,q--)
{
if (x%10<=k)
rez+=(x%10+1)*v[q][max(nr,0)];
else
rez+=max(x%10-1,0)*v[q][max(nr,0)]+v[q][max(nr-1,0)];
nr-=(x%10==k);
}
return rez;
}
int main()
{
v[0][0]=1;
for (int i=1;i<10;i++)
for (int j=i;j>=0;j--)
v[i][j]=v[i-1][j-1]+v[i-1][j]*9;
for (int i=1;i<10;i++)
for (int j=i;j>=0;j--)
v[i][j]+=v[i][j+1];
in>>a>>b>>k>>C;
freopen("cifre.out","w",stdout);
printf("%.4lf\n",(double)(nr(b)-nr(a-1))/(b-a+1));
return 0;
}