HDU5327 Olympiad
来源:互联网 发布:怎样在淘宝上卖东西 编辑:程序博客网 时间:2024/06/16 12:16
Olympiad
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1496 Accepted Submission(s): 931
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)![](about:blank)
. Please be fast to get the gold medal!
Input
The first line of the input is a single integer T (T≤1000)![](about:blank)
, indicating the number of testcases.
For each test case, there are two numbersa![](about:blank)
and b![](about:blank)
, as described in the statement. It is guaranteed that 1≤a≤b≤100000![](about:blank)
.
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
求给出的区间内有多少个YY数 (YY数就是各个位置的数都不同如12345)
一千组数据每组10万 再判断接近10亿 有时会超时看人品
事先需要打表
http://acm.split.hdu.edu.cn/showproblem.php?pid=5327
#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int aa[100010];int main(){ int t,n,m,i,j,k; char str[10]; aa[0]=0; int sum=0; for(i=1; i<=100000; i++) { itoa(i,str,10); int flag=1; for(j=0; str[j]!='\0'; j++) { for(k=j+1; str[k]!='\0'; k++) if(str[j]==str[k]) { flag=0; break; } if(!flag) break; } if(flag) { sum++;aa[i]=sum; } else aa[i]=sum; } scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); printf("%d\n",aa[m]-aa[n-1]); } return 0;}
0 0
- HDU5327 Olympiad
- 解题报告 之 HDU5327 Olympiad
- hdu5327 Olympiad(简单题:打表+模拟)
- 2015年多校联合训练第四场(Olympiad)hdu5327
- hdu5327 Olympiad(数组前缀和+set判重)
- HDU5327
- olympiad
- hdu5327 水题
- HDU5327(基础题)
- HDU5327(数位DP)
- Preparing Olympiad
- Preparing Olympiad
- Preparing Olympiad
- Team Olympiad
- 数组前缀和 & 计数排序 uva10474 hdu5327
- CodeForces 222D Olympiad
- CodeForces 222D Olympiad
- A. Team Olympiad
- jQuery 实现 select模糊查询 反射机制
- DLL注入
- Python实现抓取CSDN热门文章列表
- View与ViewGroup
- Spring 注解
- HDU5327 Olympiad
- [混合开发]HybridApp分析!!!
- 题目1082:代理服务器
- ACM学习历程7——Vector向量容量扩展机制
- [leetcode]79. Word Search -- JavaScript 代码
- WWW 服务器(BOA)搭建
- 康拓展开和它的逆运算
- torch7入门
- ubuntu 16.04 LTS l2tp vpn設定?