zoukankan      html  css  js  c++  java
  • Olympiad

      

    Olympiad
    
    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 10    Accepted Submission(s): 8
    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
    
    
    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    
    using namespace std;
    
    bool num[100010];
    
    int fun(int x)
    {
        int vis[50]={0};
        while(x)
        {
            int a=x%10;
            if(vis[a]==1)
                return 0;
            vis[a]=1;
            x/=10;
        }
        return 1;
    }
    
    int main()
    {
        for(int i=1;i<=100000;i++)
        {
            if(fun(i))
                num[i]=1;
            else
                num[i]=0;
        }
    
        int t,a,b;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d%d",&a,&b);
            int s=0;
            for(int i=a;i<=b;i++)
                if(num[i]==1)
                s++;
            printf("%d
    ",s);
        }
        return 0;
    }
    
    
    
    
    
  • 相关阅读:
    牛客网-求和
    牛客网-删除公共字符
    牛客网-字符串中找出连续最长的数字串(好未来)
    牛客网-求数列的和(挖财)
    牛客网-树的高度(小米)
    牛客网-藏宝图(网易)
    【Python学习笔记】
    php平滑升级
    Nginx平滑升级
    linux下线刷硬盘
  • 原文地址:https://www.cnblogs.com/dshn/p/4750564.html
Copyright © 2011-2022 走看看