Subnumbers

Given a positive integer N, let us define a subnumber of N as a consecutive number of digits NOT starting with 0. For example if 0, it has 7 subnumbers, namely, 1, 10, 102, 1021, 2, 21 and 1 (again). Here is your task: please calculate the sum of all the subnumbers of N. For 1021, the sum is 1+10+102+1021+2+21+1 = 1158. Since the result may be very large, output the answer modulo 1000000007 (1) please.

Input Specification:

Each input file contains one test case, which gives the integer N (0) in a line.

Output Specification:

Print in a line the sum of all N's subnumbers (modulo 1000000007).

Sample Input:

1234567890123456789

 

Sample Output:

332876913

#include<bits/stdc++.h>
using namespace std;
#define ms 1000000007u
vector<long long> v;
int main()
{
    ios::sync_with_stdio(false);
 //     freopen("data.txt","r",stdin);
      string ss;
      long long s=0,sum=0;
       cin>>ss;
       reverse(ss.begin(),ss.end());
       int k=ss.size();
       v.resize(k,1);
       for(int i=1;i<k;i++)
       v[i]=(v[i-1]*10+1)%ms;
    for(int i=0;i<k;i++)
    {
        sum+=(ss[i]-'0')*v[i];
        if(ss[i]!='0')
        s=(s+sum)%ms;
    }
    cout<<s;
    return 0;
}