d = [6,2,5,5,4,5,6,3,7,6]
a,b = map(int,input().split())
num = str(list(range(a,b+1)))
ans = 0
for i in range(len(d)):
ans+=d[i]*num.count(str(i))
print(ans)#include<bits/stdc++.h>
using namespace std;
#define ll long long
int findnum(int n){
int digit[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int sum = 0;
while(n>0){
sum = sum + digit[n % 10];
n = n / 10;
}
return sum;
}
int main(){
int a ,b;
// cout b;
cin >> a >> b;
ll total = 0;
for (int i = a; i <= b;i++){
total = total + findnum(i);
}
cout << total;
}274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |