题意是让求给定一个天数的阶乘,看这个大数中有多少个dight;
#include<iostream>
#include<string>
using namespace std;
int flag[1000];
int main()
{
int N,day,digit,c,sum;
cin>>N;
while(N--)
{
memset(flag,0,sizeof(flag));
cin>>day>>digit;
flag[0] = 1;
sum = 0;
for(int i=2;i<=day;i++)
{
c = 0;
for(int j=0;j<1000;j++)
{
int s = flag[j]*i+c;
flag[j] = s%10;
c = s/10;
}
}
int k;
for(k = 1000-1;k>=0;--k )
if(flag[k])break;
for(int i=0;i<=k;i++)
if(flag[i] == digit)
sum++;
cout<<sum<<endl;
}
}