CF244B.Undoubtedly Lucky Numbers

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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<=10^{9})$ — Polycarpus's number.

输出格式

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

输入输出样例

输入#1
```
10
```
输出#1
```
10
```
输入#2
```
123
```
输出#2
```
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.

首页