Uva 10994 - Simple Addition

By -
*** At first i have just found that what is the reminder sum result from 1 to the last range. And then, found the reminder sum result from 1 to the first-1 range. And finally, I have have got the AC result to do Subtraction operation between them :)

 
#include<bits/stdc++.h>
using namespace std;

typedef long long LL;

// Digit_Sum (SPOJ)

//int sum(int n)
//{
//    if(n<10)return ( (n* (n+1)) / 2 );
//    int t=n,i=0,x;
//    while(n/10 !=0)
//    {
//        //x=n%10;
//        i++;
//        n/=10;
//    }
//
//    int p = powl(10,i);
//
//    return ( (n*i*45*p/10) + (n* (n-1) * p/2 ) + n * (t%p + 1) + sum(t%p));
//}
//
//int main()
//{
//    int x,y;
//    while(cin >> x >> y)
//    {
//        cout << sum(y) - sum(x-1) << endl;
//    }
//
//    return 0;
//}


LL mod_sum(LL n)
{
    LL ans=0;

    while(n)
    {
        LL x = n%10;
        n/=10;
        ans+=( (x*(x+1)) / 2 ) + (n * 45);
    }

    return ans;
}

int main()
{
    LL x,y;
    while(cin >> x >> y)
    {
        if(x<0 and y<0)break;

        cout << mod_sum(y) - mod_sum(x-1) << endl;
    }

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

SPOJ-CMG - Collecting Mango

By -
#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<cmath> #include<algorithm> #define psb push_back #define ppb pop_back #define all(x) x.begin(),x.end() #define N 1000100 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; LL ar[N] , num[N]; int main() {     int t , tc=0;     //cin >> t;     sf("%d",&t);     while(t--)     {         LL n, x, arlen=-1, nmlen=-1 , i , maxi=-1 , zar;         char c;         //cin >> n;         sf("%lld",&n);         //cout << "Case " << ++tc << ":\n";       ...
Read more

Hackerearth Bishu and his Girlfriend

By -
/* Lionel Messi is such a player that you may catch him, you may touch him, you may feel him and definitely you may Love him. Lionel Messi is Messi. A little Magician in this World. */ // Accepted #include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(0) #define bfast cin.tie(0) #define outs(x) cout << x << " " #define outn(x) cout << x << "\n" #define sf scanf #define pf printf #define nl puts("") #define psb push_back #define loop0(n) for(int i=0; i<n; i++) #define loop1(n) for(int i=1; i<=n; i++) #define mpair(x , y) make_pair(x , y) #define all(x) x.begin(), x.end() #define pi acos(-1.0) #define psb push_back typedef unsigned long long ull; typedef long long LL; typedef vector<int>vii; typedef vector<LL>vll; typedef vector<string>vs; typedef map<int, int>mpii; typedef map<string, int>mpsi; typedef map<char, int>mpci; typedef map<LL, LL>mpll; cons...
Read more

Uva 10650 - Determinate Prime

By -
/*     Verdict : Accepted     Link: Determinate Prime Solution Link */ #include<bits/stdc++.h> #define limit 32009 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<int>vi; int prm[limit], plen=1; bitset<limit> bs; void sieve() {     LL i,j;     bs.set();     bs[1] = bs[0] = 0;     for(i=2; i<limit; i++)     {         if(bs[i])         {             if(i != 2)             {                 prm[plen++] = i;             }          ...
Read more