标签:
http://acm.hdu.edu.cn/showproblem.php?pid=5327
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 182 Accepted Submission(s): 130
#include<iostream> #include<cstdio> using namespace std; int a[100000]; int g(int n) { int a[10],r=0,q,i,flag=0;; while(n) { q=n%10; a[r++]=q; for(i=0;i<r-1;i++) { if(q==a[i]) flag=1; } n=n/10; if(flag==1) break; } if(flag==0) return 0; else return 1; } void fun() { int i; a[0]=0; for(i=1;i<=100000;i++) { if(g(i)==0) a[i]=a[i-1]+1; else a[i]=a[i-1]; } } int main() { fun(); int t,n,m; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); if(a[n]>a[n-1]) printf("%d\n",a[m]-a[n]+1); else printf("%d\n",a[m]-a[n]); } return 0; }
标签:
原文地址:http://www.cnblogs.com/cancangood/p/4690493.html