hdu 5327 Olympiad 简单题 2015多校联合训练赛

最新推荐文章于 2019-03-19 14:12:45 发布

GDRetop

最新推荐文章于 2019-03-19 14:12:45 发布

阅读量1.3k

点赞数

分类专栏： ##ACM-ICPC编程题文章标签： 2015多校联合训练赛多校联合训练赛

本文链接：https://blog.csdn.net/firenet1/article/details/47155431

版权

##ACM-ICPC编程题专栏收录该内容

173 篇文章 0 订阅

订阅专栏

Olympiad

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

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

Sample Output

Author

XJZX

Source

2015 Multi-University Training Contest 4

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int s[100001];

int main(){
    memset(s,0,sizeof(s));
    int flag[10];
    for(int i = 1;i <= 100000; i++){
        int j = i;
        s[i] = 1;
        memset(flag,0,sizeof(flag));
        while(j){
            flag[j%10]++;
            if(flag[j%10] > 1)s[i] = 0;
            j/=10;
        }
        s[i] += s[i-1];
    }
    int l,r;
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&l,&r);
        printf("%d\n",s[r]-s[l-1]);
    }
    return 0;
}