hdu 5327 Olympiad 简单题 2015多校联合训练赛
来源:互联网 发布:python 替换所有符号 编辑:程序博客网 时间:2024/05/22 00:41
Olympiad
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 137 Accepted Submission(s): 97
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
Author
XJZX
Source
2015 Multi-University Training Contest 4
#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>using namespace std;int s[100001];int main(){ memset(s,0,sizeof(s)); int flag[10]; for(int i = 1;i <= 100000; i++){ int j = i; s[i] = 1; memset(flag,0,sizeof(flag)); while(j){ flag[j%10]++; if(flag[j%10] > 1)s[i] = 0; j/=10; } s[i] += s[i-1]; } int l,r; int t; scanf("%d",&t); while(t--){ scanf("%d%d",&l,&r); printf("%d\n",s[r]-s[l-1]); } return 0;}
0 0
- hdu 5327 Olympiad 简单题 2015多校联合训练赛
- HDU 5327 Olympiad (2015 Multi-University Training Contest 4 2015多校联合)
- hdu 5328 Problem Killer 2015多校联合训练赛4 简单题
- hdu 5349 MZL's simple problem 2015多校联合训练赛#5 简单题
- 2015多校联合训练赛hdu 5301 Buildings 2015 Multi-University Training Contest 2 简单题
- hdu 5326 work 搜索 2015多校联合训练赛
- hdu 5417 RGCDQ 2015多校联合训练赛
- hdu 5387 Clock 2015多校联合训练赛#8
- hdu 5406 2015 多校联合训练赛#10 dp
- 2015年多校联合训练第四场(Olympiad)hdu5327
- hdu 4649 Professor Tian 多校联合训练的题
- 多校联合训练4&&HDU 5763
- 多校联合训练7&&HDU 5810
- 多校联合训练8&&HDU 5828
- hdu 5303 Delicious Apples 2015多校联合训练赛2 dp+枚举
- hdu 5338 ZZX and Permutations 2015多校联合训练赛,贪心,线段树,树状数组
- hdu 5330 Route Statistics 2015多校联合训练赛4 状态压缩
- hdu 5347 MZL's chemistry 2015多校联合训练赛#5 打表
- 暑假- ac自动机-(C - 病毒侵袭持续中)
- zTree初体验(二)——再续前缘
- hdu 5316 Magician(线段树区间合并)
- uvalive 3218
- 匆匆那年之Java程序员之最近两周的面试总结:
- hdu 5327 Olympiad 简单题 2015多校联合训练赛
- poj 1064 Cable master【二分】
- 黑马程序员——Objective-C介绍
- hdoj1551 Cable master【二分法】
- Java 线程池的原理与实现
- Android检测Cursor泄漏的原理以及使用方法
- LDD:Ch 2 构造和运行模块
- HDU 5328_Problem Killer
- buidroot使用浅谈