hdu5327 Olympiad（简单题：打表+模拟）

Link：http://acm.hdu.edu.cn/showproblem.php?pid=5327

Olympiad

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 67    Accepted Submission(s): 52

Problem Description

You are one of the competitors of the Olympiad in numbers. The problem of this year relates to beatiful numbers. One integer is called beautiful if and only if all of its digitals are different (i.e. 12345 is beautiful, 11 is not beautiful and 100 is not beautiful). Every time you are asked to count how many beautiful numbers there are in the interval  [a,b] (a≤b) . Please be fast to get the gold medal!

 

Input

The first line of the input is a single integer  T (T≤1000) , indicating the number of testcases. 

For each test case, there are two numbers  a  and  b , as described in the statement. It is guaranteed that  1≤a≤b≤100000 .

 

Output

For each testcase, print one line indicating the answer. 

 

Sample Input

  
  

   
   2
1 10
1 1000
  
  

 

Sample Output

  
  

   
   10
738
  
  

 

Source

2015 Multi-University Training Contest 4

 

AC code：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<cmath>
#define LL long long
#define MAXN 1000010
using namespace std;
const LL INF=0x3f3f3f3f;
int f[MAXN],fg[11];
int ans;
void init()
{
	memset(f,0,sizeof(f));
	int i,j;
	for(i=1;i<=10;i++)
	{
		f[i]=i;
	}
	for(i=11;i<=100001;i++)
	{
		int x=i;
		memset(fg,0,sizeof(fg));
		while(x)
		{
			int s=x%10;
			if(fg[s])
				break;
			fg[s]=1;
			x/=10;
		}
		if(x==0)
		{
			f[i]++;
		}
		f[i]+=f[i-1];
	}
}
int main()
{
	int t,a,b;
	init();
	while(scanf("%d",&t)!=EOF)
	{
		while(t--)
		{
			scanf("%d%d",&a,&b);
			ans=f[b]-f[a-1];
			printf("%d\n",ans);
		}
	}
	return 0;
}