Getting Analog - (string processing) A1001 A + B Format (20)

 

 

#include <bits/stdc++.h>
#include<math.h>
using namespace std;
const int MAX_LEN = 105;
//const int MAX_D = 31;
int main(){
    int a,b;
    cin>>a;
    cin>>b;
    int sum = a + b;
    
    int count =  0;
    while(sum != 0){
        int temp = sum % 10;
        sum =  sum / 10;
        count++; 
    } 
    int result[count];
    sum = a + b;
    int sumabs;
    int digit = count - 1;
    if(sum < 0){
        sumabs = abs(sum);
        while(sumabs != 0){
        result[digit] = sumabs % 10;
        sumabs = sumabs / 10;
        digit--;
        }
        result[0] = (result[0] - (2 * result[0]));
    } 
    if(sum > 0){
        while(sum != 0){
        result[digit] = sum % 10;
        sum = sum / 10;
        digit--;
        }
    } 
    /*if(sum == 0){
        cout<<0;
        return 0;
    }*/
    /*for(int i=0;i<count;++i){
        cout<<result[i];
    }*/
    digit = 1;
    for(int i = 0;i<count;++i){
        if(digit != 3){
            cout<<result[i];
            digit++;
            continue;
        }
        if(digit == 3 && i != count-1){
            cout<<result[i]<<",";
            digit = 1;
            continue;
        }
        if(digit == 3 && i == count-1){
            cout<<result[i];
            continue;
        }
    }
    system("pause");
    return 0;
} 

 

 

#include <bits/stdc++.h>
#include<math.h>
using namespace std;
const int MAX_LEN = 105;
//const int MAX_D = 31;
int main(){
    int a,b,sum;
    cin>>a;
    cin>>b;
    sum = a+b;
    if(sum<0){
        cout<<"-";
        sum = abs(sum);
    }
    if(sum == 0){
        cout<<"0";
        return 0;
    }
    int result[10];
    int digit=0;
    while(sum){
        result[digit++] = sum % 10;
        sum = sum/10;
    }
    //int result[digit]; 
    for(int k = digit-1;k>=0;--k){
        cout<<result[k];
        if(k!=0 && k % 3 == 0){
            cout<<",";
        }
    }
    system("pause");
    return 0;
} 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

---

---