#include<stdio.h> #include<string.h> #include<math.h> int s[100010]; //建立数组比一个一个计算更快 int cmp(const void *a,const void *b){ return *(int *)a - *(int *)b; } int isBea(int n){ int a[10]; int i,num = 0; while(n){ a[num++] = n%10; n = n/10; } qsort(a,num,sizeof(int),cmp); for(i = 1;i < num; i++){ if(a[i]==a[i-1]) return 0; } return 1; } int main(){ int t; scanf("%d",&t); while(t--){ int a,b; scanf("%d %d",&a,&b); int i,sum = 0; for(i = 1;i <= 100000; i++){ s[i] = s[i-1] + isBea(i); } printf("%d\n",s[b]-s[a-1]); } } |
Double click to view unformatted code.