uva12527 Different Digits

uva12527

uDebug12527

简单题，一个数字（number）的各个位（digit）上的数字如果有重复，则视为有重复数位的数。给定两个数字0<=N<=M<= 5000，求N和M之间没有重复数位的数有多少个。

由于本身数字也不多，直接开个数组d，把每个数i是否是重复数位的结果存储到d[i]，然后再另一个数组s，直接累加结果，答案也就很快出来了。

python版本代码

s = [0 for i in range(5001)]
d = [0 for i in range(5001)]

def IsRepeat(num):
    a = [0 for i in range(10)]
    while num > 0:
        x = num % 10
        if a[x] == 0:
            a[x] = 1
        else:
            return False
        num //= 10
    return True
        
for i in range(5001):
    if i == 0:
        continue
    else:
        if IsRepeat(i) == True:
            d[i] = 1
        s[i] = s[i-1] + d[i]

try:
    while True:
        N,M = input().split()
        N = int(N)
        M = int(M)
        print(s[M]-s[N]+d[N])
except Exception as e:
    pass
    

C/C++版本代码

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;

//#define ZANGFONG
const int maxn = 5050;
int d[maxn],s[maxn];
int a[10];
bool isrepeat(int x)
{
    int i;
    memset(a,0,sizeof(a));
    while(x)
    {
        i = x%10;
        if(a[i]==0) a[i]++;
        else return false;
        x /= 10;
    }
    return true;
}

int main()
{
    #ifdef ZANGFONG
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif // ZANGFONG
    int N,M,i;

    for(i = 1; i <= 5000; i++)
    {
        if(isrepeat(i)) d[i] = 1;
        s[i] = d[i] + s[i-1];
    }

    while(scanf("%d%d\n",&N,&M)!= EOF)
    {
        printf("%d\n",s[M]-s[N]+d[N]);
    }

    return 0;
}