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";         pf("Case %d:\n",++tc);         getchar();         while(n--)         {             //cin >> c;             sf("%c",&c);             if(c == 'A')             {                 //cin >> x;           
Read more

LightOJ 1009 - Back to Underworld

By -
// Accepted /* Analysis: Consider a Graph as 1-2, 2-3, 2-4; if 1 is a vampire than 2 is lykan, as 2 is lykan so 3 and 4 will be vampire. Now total vampires are 3 and lykan is 1, so maximum from this graph is 3. [1=3=4=vampire] another graph is 5-6 and 6-7, 6-8. consider 5 is a vampire so 6 will be lykan. as 6 is lykan than the all adjacent of 6 will be vampire, i mean, 7=8=vampire. Now total vampires are 3 and lykan is 1, so maximum from this graph is 3. And the Answer of this total Graph is 3 + 3 = 6; [As, Graphs are not connected] Decision: If a node is Vampire than all of the adjacent of that node will be Lykan and if a node is Lykan than all of the adjacent of that node will be Vampire, thats why i have represented them as two color black and red. Black means Vampire and Red means Lykan, besides every time i have increased number of vampire and lykans and finally add the maximum as graphs are not connected. */ #include<cstdio> #include<cmath> #include<vector> #in
Read more

LeetCode Palindrome Number

By -
 Problem Description Link:  https://leetcode.com/problems/palindrome-number/ Accepted Solution /* The solution is easy, and I believe everyone knows the process. However, one problem is that x is a number. If it is a string, in that case, we can get the result after reversing it. Therefore, to solve the problem, we have to find the digits by modulating 10, store them in an array, and finally compare from both sides. If we find any discrepancy, we can tell it is not a palindrome. Note that any negative integer would never be a palindrome since it should contain a minus (-) sign. */ class Solution { public:     bool isPalindrome ( int x ) {         int digit [ 50 ], len= 0 ;         bool f = true ;         if (x < 0 ) {             return false ;         }         while (x> 0 )         {             digit [len++] = x% 10 ;             x/= 10 ;         }         for ( int i= 0 , j=len- 1 ; i<len; i++, j--)         {             if ( digit [i] != digit [j])             {  
Read more