OJ Board

Code: Select all

#include <stdio.h>
#include <string.h>

class BigNum {
  private:
    enum { DigitSize = 1024 };
    char  number[DigitSize];
    int   size;
  public:
    BigNum () { 
      Clean();
    }

    inline void Clean(){
      size = 0;
      for (int i = 0;i < DigitSize;i ++){
	number[i] = 0;
      }
    }

    void SetNum(char *str){
      size = strlen(str);
      for (int i = 0; i < size; i++) {
	number[i] = str[size-i-1] - '0';
      }

    }

    friend BigNum& operator+(const BigNum& a,const BigNum& b);

    void Print(){
      int i;
      int flag = 0;
      for(i = size ; i >= 0 ; i--){
	if (number[i] != 0 || flag == 1)
	  printf("%d",number[i]);	
	if (number[i] != 0 )
	  flag = 1;
      }
      if (flag == 0 )
	printf("0");
    }

    void Reverse(){
      char num[DigitSize];
      int i;
      for (i = 0;i < size ;i++){
	num[i] = number[size-i-1];		
      }
      for (i = 0 ; i < size ; i++){
	number[i] = num[i];
      }
    }

    void ReSize(){
      int i,sz;
      for(i = size; i >= 0;i--){
	if (number[i] != 0) break;
      }
      size = i+1;
    }
};

BigNum& operator+(const BigNum& a,const BigNum& b)  {
  int i;
  int sizeMax;
  int flag; 
  static BigNum num ;

  num.Clean();
  sizeMax = (a.size >= b.size) ? a.size : b.size;

  for (i = flag = 0; i < sizeMax; i++){
    num.number[i] = a.number[i] + b.number[i] + flag ;
    if (num.number[i] >= 10){
      num.number[i] -= 10;
      flag = 1;
    } else
      flag = 0;
  }

  if (flag == 1){
    num.size = sizeMax + 1;
    num.number[i] = flag;
  }
  else 
    num.size = sizeMax;

  return num;
}



int main(){
  char in1[1024],in2[1024];

  while(scanf(" %s%s",in1,in2) != EOF){
   
    BigNum aa,bb,cc;
    aa.SetNum(in1);
    bb.SetNum(in2);
    aa.ReSize();
    bb.ReSize();
    aa.Reverse();
    bb.Reverse();
    cc = aa + bb;
    cc.ReSize();
    cc.Reverse();
    cc.Print();
    printf("\n");
  }

  return 0;
}

Code: Select all

//#include <stack> 
#include <iostream>
#include <string>

using namespace std;

void swap (char *a, char *b)
{
 *a = *a + *b;
 *b = *a - *b;
 *a = *a - *b;
}

int getNumber (char c)
{
 return (int)(c-48);	
}

char getChar (int i)
{
 return (char)(i+48);	 
}


/* reverse does what it does, dont ask it to do more :p */
void reverse(string &x)
{
 // using stacks to reverse a string is freaking brilliant IMHO :)
 // too bad we cant use em :S
 
 /*
 stack<char> s;

 const int n = x.length();

 for (int i=0; i<n; ++i) 
 	 s.push(x[i]);

 for (int i=0; !s.empty(); ++i, s.pop())
 	 x[i]=s.top();
 */
 
 int n = x.length();
 
 for (int i=0 ; i < x.length()/2 ; i++) {
 	 swap(&x[i], &x[--n]);	 
 }
 
} // end reverse()



void kickTrailingZeros(string &x)
{
 int n = x.length();
 
 for (int i=n-1 ; i>0 ; i--) {
 	 if (x[i] == '0') {
	 	x.erase(i);		  
     } else
	    break;	 
 }	 
} // end kickTrailingZeros()





void kickLeadingZeros(string &x)
{ 
 while ( (x[0] == '0') && (x.length() != 1) ) {
 	   x.erase(0, 1);	   	   
 }
} // end kickLeadingZeros()





string sum( string &top, string &bottom )
{
 int nb = bottom.length();
 int nt = top.length() - 1;
	
 int a,b,c, carry = 0;
 
 //cout << top << " " << bottom << endl;
	
 for (int i=nb-1 ; i>=0 ; i--) {
	 a = getNumber(bottom[i]);
	 b = getNumber(top[nt]);
	 c = (a+b+carry) % 10;
	 
	 if ((a+b+carry) > 9)	   
	    carry = 1;
	 else
 	    carry = 0;
		
	 //cout << chr << endl;	
	 top.replace( nt, 1, 1, getChar(c) );
	 nt--;
	 //cout << top << endl;
 }
 
 if (carry == 1) {
 	// doing a bit shift here :)
 	
 	if (nt < 0) {
  	   top.insert( 0, 1, getChar(1) );
    } else if (nt == 0) {
	   b = getNumber(top[nt]);
	   c = (carry+b) % 10 ;
	   top.replace( nt, 1, 1, getChar(c) );
	   
	   if ((carry+b) > 9)
	   	  top.insert( 0, 1, getChar(1) );
	   
    } else {
	   b = getNumber(top[nt]);
	   c = carry+b;
   	   top.replace( nt, 1, 1, getChar(c) );  	   
    }
 }	 
 
 return top;	 
} // end sum()




string process( string &num1, string &num2 )
{
 reverse(num1) ; kickLeadingZeros(num1);
 reverse(num2) ; kickLeadingZeros(num2);

 string res;
 
 if (num1.length() > num2.length())
 	res = sum(num1, num2); 	
 else
    res = sum(num2, num1);
 
 reverse(res); kickLeadingZeros(res);
 
 return res;
} // end rev()





int main() 
{
 
 unsigned int cases;
 cin >> cases;
 
 string num1[cases], num2[cases];
 
 for (int i=0 ; i<cases ; i++) { 	   
  	 cin >> num1[i] >> num2[i];
 }
 
 cout << endl;
 
 for (int i=0 ; i<cases ; i++) { 	   
 	 string cpy1 = num1[i], cpy2 = num2[i]; 	 
 	 cout << process (cpy1, cpy2) << endl;
 }
 return 0;
 
} // end main(); 

Code: Select all

foo.cc: In function `int main()':
foo.cc:159: error: ISO C++ forbids variable-size array `num1'
foo.cc:159: error: ISO C++ forbids variable-size array `num2'

Code: Select all

string num1[100], num2[100];

Code: Select all

#include<stdio.h>
long int power(long int b,long int p);
long int revint(long int a);
void main()
{
	long int t,a,b,i,fa,fb,fab,ffab;
	while(scanf("%ld",&t)!=EOF)
	{
	for(i=1;i<=t;i++)
	{
		scanf("%ld%ld",&a,&b);
		fa=revint(a);
		fb=revint(b);
		fab=fa+fb;
		ffab=revint(fab);
		printf("%ld\n",ffab);
	}
	}
}

long int power(long int b,long int p)
{
	long int i,result=1;
	for(i=1;i<=p;i++)
		result*=b;
	return(result);
}


long int revint(long int a)
{
	long int i,mod,m[50],j,fa=0,k;
		for(i=1;a!=0;i++)
		{
			mod=a%10;
			m[i]=mod;
			a=a/10;
		}
		for(j=i-1,k=0;j>=1;j--,k++)
			fa=fa+m[j]*power(10,k);
	return(fa);
}