CodeForces - 244B

CodeForces - 244B Undoubtedly Lucky Numbers

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.

Input
The first line contains a single integer n (1 ≤ n ≤ 109) — Polycarpus’s number.

Output
Print a single integer that says, how many positive integers that do not exceed n are undoubtedly lucky.

Examples
Input
10
Output
10
Input
123
Output
113
Note
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.

论会搜索的重要性……当然了会也不一定能写出来，就没往这方面想，当时沉迷于找规律无法自拔来着。

#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include<set>
#define N 200100
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int INF=99999999;
const int MAX=2e6+5;
set<long long int>s;
void dfs(int n,int x,int y,long long res,int cnt){
	if(res>n||(res==0&&cnt>0))
		return;
	if(res>0)
		s.insert(res);
	dfs(n,x,y,res*10+x,cnt+1);
	dfs(n,x,y,res*10+y,cnt+1);
}
int main(int argc, char** argv) {
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<=9;i++){
		for(j=i+1;j<=9;j++){
			dfs(n,i,j,0,0);
		}
	}
	printf("%d\n",s.size());
	return 0;
};