xtu ACM Eason

Eason

Description

#include <cmath>
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <malloc.h>
#include <stdlib.h>
using namespace std;

int cal(int n)
{
int a4,a7,a3=0,a6=0;
while(n)
{
if(n%10==3)
a3=1;
if(n%10==6)
a6=1;
if(n%10==4)
return 0;
if(n%10==7)
return 0;
n/=10;
}
if(a3==1||a6==1)
return 1;
else
return 3;
}

int main()
{
int a,b,aa,bb,i,*a1,*a2,j,k;

a1=(int*)malloc(1000005*sizeof(int));
a2=(int*)malloc(1000005*sizeof(int));

a1[0]=0;a2[0]=0;
for(i=1;i<1000001;i++)
{
k=cal(i);
switch(k)
{
case 1:a1[i]=a1[i-1]+1,a2[i]=a2[i-1]+0;break;
case 0:a2[i]=a2[i-1]+1,a1[i]=a1[i-1]+0;break;
case 3:a2[i]=a2[i-1],a1[i]=a1[i-1];break;
}
}
while(1)
{
cin>>a>>b;
if(a==0&&b==0)
return 0;
cout<<a1[b]-a1[a-1]<<" "<<a2[b]-a2[a-1]<<endl;
}
}