CF261E.Maxim and Calculator
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Maxim has got a calculator. The calculator has two integer cells. Initially, the first cell contains number 1 , and the second cell contains number 0 . In one move you can perform one of the following operations:
- Let's assume that at the current time the first cell contains number a , and the second cell contains number b . Write to the second cell number b+1 ;
- Let's assume that at the current time the first cell contains number a , and the second cell contains number b . Write to the first cell number a⋅b .
Maxim is wondering, how many integers x (l<=x<=r) are there, such that we can write the number x to the first cell of the calculator, having performed at most p moves.
输入格式
The first line contains three integers: l , r , p (2<=l<=r<=109,1<=p<=100) .
The numbers in the line are separated by single spaces.
输出格式
In a single line print a single integer — the answer to the problem.
输入输出样例
输入#1
2 10 3
输出#1
1
输入#2
2 111 100
输出#2
106
输入#3
2 111 11
输出#3
47