[HDOJ5327]Olympiad

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5327

打表预处理数据范围内所有的符合条件的数再查询即可。

 1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <iostream>
 6 #include <cmath>
 7 #include <cctype>
 8 #include <queue>
 9 #include <map>
10 #include <set>
11 #include <stack>
12 #include <list>
13 #include <vector>
14
15 using namespace std;
16
17 const int maxn = 100010;
18 int a, b;
19 int num[maxn];
20 int vis[10];
21
22 void init() {
23     memset(num, 0, sizeof(num));
24     int tmp, flag;
25     num[0] = 0;
26     for(int i = 1; i < maxn; i++) {
27         memset(vis, 0, sizeof(vis));
28         flag = 0;
29         num[i] = num[i-1];
30         int k = i;
31         while(k) {
32             tmp = k % 10;
33             if(!vis[tmp]) {
34                 vis[tmp] = 1;
35             }
36             else {
37                 flag = 1;
38                 break;
39             }
40             k /= 10;
41         }
42         if(!flag) {
43             num[i]++;
44         }
45     }
46 }
47 int main() {
48     // freopen("in", "r", stdin);
49     int T;
50     init();
51     scanf("%d", &T);
52     while(T--) {
53         scanf("%d %d", &a, &b);
54         printf("%d\n", num[b] - num[a-1]);
55     }
56 }

转载于:https://www.cnblogs.com/kirai/p/4781648.html

[HDOJ5327]Olympiad相关推荐

hdu 5327 Olympiad
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5327 Olympiad Description You are one of the competit ...
Olympiad（求区间内的美丽数）超详细 (C,C++)
题目: You are one of the competitors of the Olympiad in numbers. The problem of this year relates to b ...
C. Tyler and Strings（组合数学,树状数组维护前缀和）(Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad i)
对我来说比较困难的一题了,尝试着自己写了一下,调不出来遂放弃. Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad in Info ...
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics）简训
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics)简训导语涉及的知识点题目 A Game B ...
Olympiad (奥林匹克信息赛) Visual Judge (Set3)
文章目录题目描述输入描述输出描述输入输出样例线索提示一.解题思路二.题解源代码 VJudge评判结果写在最后题目描述 The recent All-Berland Olympiad ...
【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A】Palindrome Dance
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] i从1..n/2循环一波. 保证a[i]和a[n-i+1]就好. 如果都是2的话填上min(a,b)*2就好其他情况跟随非2的. ...
Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)
A. Fraction 题目链接:http://codeforces.com/contest/854/problem/A 题目意思:给出一个数n,求两个数a+b=n,且a/b不可约分,如果存在多组满足 ...
【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B】Shashlik Cooking
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 翻转一次最多影响2k+1个地方. 如果n<=k+1 那么放在1的位置就ok.因为能覆盖1..k+1 如果n<=2k+1 ...
格子染色问题 java_《Mathematical Olympiad——组合数学》——染色问题
问题一: 将一些石头放入10行14列的矩形方格表内,允许在每个单元格内放入石头的数目多于1块,然后发现每一行每一列上均有奇数块石头.若将矩形方格表上的单元格相间地染为黑色和白色,证明:在黑色单元格上石 ...

[HDOJ5327]Olympiad

[HDOJ5327]Olympiad相关推荐

最新文章

热门文章