MYF

HDU 5327 Olympiad

Posted on | In | | Visitors

题目链接

HDU 5327

题目分析

题目大意

漂亮的数字定义：各位上没有重复数字，给定区间[l, r]，问区间内共有多少漂亮的数字。

解析

打表即可

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
#define Memset(a,val) memset(a,val,sizeof(a))
#define PI acos(-1)
#define rt(n)       (i == n ? '\n' : ' ')
#define hi         printf("Hi----------\n")
#define IN freopen("input.txt","r",stdin);
#define OUT freopen("output.txt","w",stdout);
#define debug(x) cout<<"Debug : ---"<<x<<"---"<<endl;
#pragma comment(linker, "/STACK:1024000000,1024000000")
typedef long long ll;
using namespace std;
const int maxn=100000+5;
const int mod=1000000007;
const int INF=0x3f3f3f3f;
const double eps=1e-8;
int c[maxn];
int work(int x){
    int vis[10]={};
    int num=x;
    while (x!=0) {
        if(++vis[x%10]>1){
            return 0;
        }
        x/=10;
    }
    return 1;
}
int main(){
    for (int i=1; i<maxn; i++) {
        c[i]=c[i-1]+work(i);
    }
    int t;
    cin>>t;
    int l,r;
    while (t--) {
        cin>>l>>r;
        cout<<c[r]-c[l-1]<<endl;
    }
    return 0;
}