hdu5327 Olympiad(简单题:打表+模拟)
来源:互联网 发布:淘宝卖家能知道买家 编辑:程序博客网 时间:2024/05/23 21:29
Link:http://acm.hdu.edu.cn/showproblem.php?pid=5327
Olympiad
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 67 Accepted Submission(s): 52
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 numbersa and b , as described in the statement. It is guaranteed that 1≤a≤b≤100000 .
For each test case, there are two numbers
Output
For each testcase, print one line indicating the answer.
Sample Input
21 101 1000
Sample Output
10738
Source
2015 Multi-University Training Contest 4
AC code:
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<vector>#include<queue>#include<map>#include<cmath>#define LL long long#define MAXN 1000010using namespace std;const LL INF=0x3f3f3f3f;int f[MAXN],fg[11];int ans;void init(){memset(f,0,sizeof(f));int i,j;for(i=1;i<=10;i++){f[i]=i;}for(i=11;i<=100001;i++){int x=i;memset(fg,0,sizeof(fg));while(x){int s=x%10;if(fg[s])break;fg[s]=1;x/=10;}if(x==0){f[i]++;}f[i]+=f[i-1];}}int main(){int t,a,b;init();while(scanf("%d",&t)!=EOF){while(t--){scanf("%d%d",&a,&b);ans=f[b]-f[a-1];printf("%d\n",ans);}}return 0;}
0 0
- hdu5327 Olympiad(简单题:打表+模拟)
- HDU5327 Olympiad
- 2015年多校联合训练第四场(Olympiad)hdu5327
- 解题报告 之 HDU5327 Olympiad
- 打表-HDOJ-5327-Olympiad
- hdu5327 Olympiad(数组前缀和+set判重)
- 模拟题2(打表)
- HDU5327(基础题)
- HDU5327(数位DP)
- HDU5327
- HDU1216 练习一下打表(模拟题)
- CF #347 (Div.2) C. International Olympiad(模拟)
- 模拟打僵尸(OC-继承题)
- hdu2060 模拟打表
- zzulioj1863(模拟&打表)
- HDU5641(打表,模拟)
- Codeforces Round 306 B Preparing Olympiad(简单dfs)
- [模拟] 多校联合第四场 HDU5327 Olympad
- stdout 与 stderr区别
- CGRectInset、CGRectOffset详解
- MTK中加入ETT测试代码
- 当启动多个Activity后从最后一个activiy越级返回方法
- 分析android动画模块
- hdu5327 Olympiad(简单题:打表+模拟)
- 我的游戏开发笔记(二):加状态以及检东西
- eclipse中用struts2时报Path must include project and resource name: /struts-default.xml的错误
- Zend里正则替换
- 机房收费系统之实时错误‘94’无效使用null值
- 《面向 SSD/HDD 混合存储的动态缓存调度算法 DRC 》结--
- C-1.1
- VirtualBox 创建com对象失败
- 使用Android Studio 1.3 版本进行NDK开发