Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- long long r, l, time;
- long long result = 0;
- cin >> l >> r;
- time = r;
- int size = 0;
- while(time > 0){
- time /= 10;
- size += 1;
- }
- long long dp[101][10];
- for (int i = 0; i < size; ++i){
- for (int j = 0; j < 10; ++j){
- dp[i][j] = 0;
- if (i == 1 && j != 0){
- dp[i][j] = 1;
- }
- }
- }
- for (int i = 1; i < size; ++i){
- for (int j = 1; j < 10; ++j){
- for (int z = 9; z >= j; --z){
- dp[i][j] = (dp[i][j] + dp[i - 1][z]) % (1000000000 + 7);
- }
- result = (result + dp[i][j]) % (1000000000 + 7);
- }
- }
- cout << result;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement