HDU5327 Olympiad

最新推荐文章于 2017-12-21 16:21:22 发布

没有灵魂的程序员

最新推荐文章于 2017-12-21 16:21:22 发布

阅读量496

点赞数

分类专栏：基础题文章标签：杭电 c语言

本文链接：https://blog.csdn.net/xky140610205/article/details/52291627

版权

基础题专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Olympiad

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

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

求给出的区间内有多少个YY数 (YY数就是各个位置的数都不同如12345)

一千组数据每组10万再判断接近10亿有时会超时看人品

事先需要打表

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

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int aa[100010];
int main()
{
    int t,n,m,i,j,k;
    char str[10];
    aa[0]=0;
    int sum=0;
    for(i=1; i<=100000; i++)
    {
        itoa(i,str,10);
        int flag=1;
        for(j=0; str[j]!='\0'; j++)
        {
            for(k=j+1; str[k]!='\0'; k++)
                if(str[j]==str[k])
                {

                    flag=0;
                    break;
                }
            if(!flag) break;
        }
        if(flag)
        {
            sum++;aa[i]=sum;
        }
        else aa[i]=sum;
    }

    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        printf("%d\n",aa[m]-aa[n-1]);
    }
    return 0;
}