func_code_string: #include <bits/stdc++.h>   using namespace std;   int gcd(int a, int b) {     int r;     while (b) {       r = a % b;       a = b;       b = r;     }     return a;   }   int GCD(int a, int b) {     if (a == 0)       return b;     else       return GCD(b % a, a);   }   long long int power(long long int a, long long int b) {     long long int r = 1;     while (b) {       if (b & 1) {         r = r * a;         b--;       }       a = a * a;       b >>= 1;     }     return r;   }   int palindrome(char *s, int len) {     int i, j, k, count = 0, c = 0;     for (i = 0, j = len - 1; i < len, j >= 0; i++, j--) {       if (s[i] == s[j]) count++;     }     if (count == len)       return 1;     else       return 0;   }   long long int binary(char *s, long long int len) {     long long int i, j, k, r = 0, p = 0, num;     for (i = len - 1; i >= 0; i--) {       num = s[i] -  0 ;       r += (num * power(2, p));       p++;     }     return r;   }   int binary_search(int *ara, int size, int n) {     int high, mid, low;     low = 0;     high = size - 1;     while (low <= high) {       mid = (low + high) / 2;       if (ara[mid] == n) {         return 1;       } else if (n > ara[mid])         low = mid + 1;       else if (n < ara[mid])         high = mid - 1;     }     return -1;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(nullptr);     cout.tie(nullptr);     int i, j, k, n, T, q, a, b, num;     string s1, s2;     cin >> a >> b;     int ara[] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};     long long sum = 0;     for (i = a; i <= b; i++) {       num = i;       while (num) {         int mod = num % 10;         sum = sum + (ara[mod]);         num /= 10;       }     }     cout << sum << endl;   }   