Codeforces Round #150 (Div. 2) B. Undoubtedly Lucky Numbers
来源:互联网 发布:阿里云华北2区 编辑:程序博客网 时间:2024/04/29 10:09
点击打开题目链接
Polycarpus loves lucky numbers. Everybody knows that lucky numbers are positive integers, whose decimal representation (without leading zeroes) contain only the lucky digits x and y. For example, if x = 4, and y = 7, then numbers 47, 744, 4 are lucky.
Let's call a positive integer a undoubtedly lucky, if there are such digits x and y (0 ≤ x, y ≤ 9), that the decimal representation of number a (without leading zeroes) contains only digits x and y.
Polycarpus has integer n. He wants to know how many positive integers that do not exceed n, are undoubtedly lucky. Help him, count this number.
The first line contains a single integer n (1 ≤ n ≤ 109) — Polycarpus's number.
Print a single integer that says, how many positive integers that do not exceed n are undoubtedly lucky.
10
10
123
113
In the first test sample all numbers that do not exceed 10 are undoubtedly lucky.
In the second sample numbers 102, 103, 104, 105, 106, 107, 108, 109, 120, 123 are not undoubtedly lucky.
题意:如果一个数只由两个或一个数字组成,那么说明它是一个Undoubtedly Lucky Numbers,输入一个n,问从1到n一共有多少这样的数?
起初考虑的是用set,后来想了想发现只用set不可以,后来发现这种数是有规律的,于是变成了一个简单的深搜题。
代码:
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<set>#include<algorithm>using namespace std;set<int>ss;set<int>::iterator iter; int x,y; long long n,i;void dfs(long long sa,int ans) { if(sa>n||ans>10) return ; ss.insert(sa); dfs(sa*10+x,ans+1); dfs(sa*10+y,ans+1); } int main() { cin>>n; for(x=0;x<10;x++) for(y=x+1;y<10;y++) dfs(0,0);/*for(iter=ss.begin();iter!=ss.end();iter++) { cout<<*iter<<"&&"; }*/ printf("%d\n",ss.size()-1); return 0; }
- Codeforces Round #150 (Div. 2) B. Undoubtedly Lucky Numbers
- CodeForces - 244B Undoubtedly Lucky Numbers
- codeforces 244B Undoubtedly Lucky Numbers(set)
- CF - 244B - Undoubtedly Lucky Numbers
- Codeforces Round #160 (Div. 2)---A. Roma and Lucky Numbers
- Codeforces Beta Round #77 (Div. 1 Only), problem: (B) Lucky Numbers 数位DP+剪枝DFS+贪心
- Codeforces Round #232 (Div. 2) B. On Corruption and Numbers
- Codeforces Round #136 (Div. 2) B. Little Elephant and Numbers
- Codeforces Round #139 (Div. 2) B. Well-known Numbers
- Codeforces Round #310 (Div. 2) B. Case of Fake Numbers
- Codeforces Round #232 (Div. 2)-B. On Corruption and Numbers
- Codeforces Round #131 (Div. 1) B. Numbers
- 2016 Personal Training #8 Div.2 I - Lucky Numbers CodeForces 95B
- Codeforces Round #104 (Div. 2) E - Lucky Subsequence
- Codeforces Round #104 (Div. 2) E Lucky Subsequence
- Codeforces Round #104 (Div. 2)---A. Lucky Ticket
- Codeforces Beta Round #91 (Div. 2 Only) C. Lucky Sum
- Codeforces Beta Round #91 (Div. 2 Only) D. Lucky Transformation
- Java小记
- 从编译和链接来看kernel驱动注册的过程
- Ganymed SSH-2 for Java系列8之SFTPv3Client说明
- 爱上一个人的7个预兆
- 驾驭大数据第七章部分内容
- Codeforces Round #150 (Div. 2) B. Undoubtedly Lucky Numbers
- Ganymed SSH-2 for Java系列9之scpPut
- struts2 多个文件上传
- C语言一些编程心得(转帖)
- 精妙SQL语句收集
- cnn为什么在提取特征时那么有效?
- Ganymed SSH-2 for Java系列10之scpGet
- 22款编程的字体
- static关键字及其应用;静态代码块