Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
- #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
- // #pragma comment(linker, "/stack:200000000"]
- #include <iostream>
- #include <vector>
- #include <cmath>
- #include <algorithm>
- #include <unordered_set>
- #include <unordered_map>
- #include <set>
- #include <map>
- #include <queue>
- #include <deque>
- #include <bitset>
- #include <stack>
- #include <random>
- #include <fstream>
- #include <sstream>
- #include <chrono>
- #define fi first
- #define se second
- #define pb push_back
- #define ll long long
- #define ld long double
- #define hm unordered_map
- #define pii pair<int, int>
- #define sz(a) (int)a.size()
- #define all(a) a.begin(), a.end()
- #define cinv(v) for (auto& x: v) cin >> x
- #define fr(i, n) for (int i = 0; i < n; ++i)
- #define fl(i, l, n) for (int i = l; i < n; ++i)
- #define int ll
- using namespace std;
- #ifdef __LOCAL
- #define dbg(x) cerr << #x << " : " << x << '\n'
- const int maxn = 20;
- #else
- #define dbg(x)
- const int maxn = 2e5 + 20;
- #endif
- //tg: @galebickosikasa
- ostream& operator << (ostream& out, vector<int>& v) {
- for (auto& x: v) out << x << ' ';
- return out;
- }
- ostream& operator << (ostream& out, pii& v) {
- out << v.fi << ", " << v.se;
- return out;
- }
- istream& operator >> (istream& in, pii& a) {
- in >> a.fi >> a.se;
- return in;
- }
- const ll inf = (ll) 2e9;
- const ld pi = asin (1) * 2;
- const ld eps = 1e-8;
- const ll mod = (ll)1e9 + 7;
- const ll ns = 97;
- mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
- ll mult (ll a, ll b) {
- return a * b % mod;
- }
- ll add (ll a, ll b) {
- int c = a + b;
- if (c >= mod) c -= mod;
- return c;
- }
- ll powmod (ll a, ll n) {
- if (n == 0) return 1;
- if (n % 2) return mult (a, powmod (a, n - 1));
- ll b = powmod (a, n / 2);
- return mult (b, b);
- }
- ll inv (int a) {
- return powmod (a, mod - 2);
- }
- int MAX_SIZE = 0;
- vector<vector<int>> get (string s) {
- int sum = 0;
- fr (i, sz (s)) {
- sum = (sum * 10 + s[i] - '0') % mod;
- }
- ++sum;
- vector<vector<int>> ans = vector<vector<int>> (sz (s), vector<int> (10));
- int t = 0;
- reverse (all (s));
- fl (i, 1, sz (s)) {
- t = add (t, powmod (10, i - 1) * (s[i] - '0') % mod);
- }
- fr (i, 10) ans[0][i] = t;
- fr (i, s[0] - '0' + 1) ++ans[0][i];
- fl (i, 1, sz (s)) {
- t -= powmod (10, i - 1) * (s[i] - '0') % mod;
- if (t < 0) t += mod;
- fr (j, 10) ans[i][j] = t;
- int r = (t * 10 + powmod (10, i) * (s[i] - '0')) % mod;
- fr (j, s[i] - '0') ans[i][j] = add (ans[i][j], powmod (10, i));
- ans[i][s[i] - '0'] = sum - r;
- if (ans[i][s[i] - '0'] < 0) ans[i][s[i] - '0'] += mod;
- }
- vector<int> tmp (10);
- tmp[0] = sum - 1;
- while (sz (ans) < MAX_SIZE) ans.pb (tmp);
- return ans;
- }
- signed main () {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- string a, b;
- cin >> a >> b;
- MAX_SIZE = sz (b);
- auto x = get (a), y = get (b);
- // --x[sz (a) - 1][a[0] - '0'];
- reverse (all (a));
- fr (i, sz (a)) --x[i][a[i] - '0'];
- vector<vector<int>> d (sz (b), vector<int> (10));
- fr (i, sz (b)) {
- fr (j, 10) {
- d[i][j] = y[i][j] - x[i][j];
- dbg (i);
- dbg (j);
- dbg (d[i][j]);
- dbg (x[i][j]);
- dbg (y[i][j]);
- }
- }
- int ans = 0;
- fr (k, sz (b)) {
- fr (i, 10) {
- fr (j, 10) {
- ans = add (ans, abs (i - j) * d[k][i] * d[k][j] % mod);
- }
- }
- }
- cout << ans << '\n';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement