OJ Board

Code: Select all

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define MAX 1000
#define MAXSZ 500
#define MAXARRAY 10000
#define MAX_INT 32767

void str_add(char first[],char second[],long len1,long len2);
void str_mul(char aa[],char bb[],long aa_l,long bb_l);

void main()
{
long flag,len1,len2,num1,num2;
char ch,first[MAXARRAY],second[MAXARRAY],str[MAXARRAY];
while(gets(str))
 {
 sscanf(str,"%s %c %s",first,&ch,second);
 len1=strlen(first);
 len2=strlen(second);

 printf("%s\n",str);

 flag=1;
 if(len1>5)
   {
   flag=0;
   printf("first number too big\n");
   }
 else if(len1==5)
   {
   flag=1;
   num1=atol(first);
   if(num1>MAX_INT)
      {
      flag=0;
      printf("first number too big\n");
      }
   else if(num1<=MAX_INT)
      flag=1;
   }

 if(len2>5)
   {
   flag=0;
   printf("second number too big\n");
   }

 else
 if(len2==5)
   {
   flag=1;
   num2=atol(second);
   if(num2>MAX_INT)
      {
      flag=0;
      printf("second number too big\n");
      }
   else if(num2<=MAX_INT)
      flag=1;
   }

 if(flag==0)
  printf("result too big\n");
 else
 if(flag==1)
   {
   if(ch=='+')
     str_add(first,second,len1,len2);
   else if(ch=='*')
     str_mul(first,second,len1,len2);
   }
 }
}

void str_add(char first[],char second[],long len1,long len2)
{
long sum,max,min,dif,re,qu,num,a,i,j,k,x,y,len;
char result[MAXARRAY];

if(len1>=len2)
 {
 max=len1;
 min=len2;
 dif=max-min;

 for(a=min-1;a>=0;a--)
   second[a+dif]=second[a];

 for(a=0;a<dif;a++)
   second[a]='0';

 }
else if(len1<len2)
 {
 max=len2;
 min=len1;
 dif=max-min;

 for(a=min-1;a>=0;a--)
   first[a+dif]=first[a];

 for(a=0;a<dif;a++)
   first[a]='0';

 }

qu=0;

i=MAX-1;
for(a=max-1;a>=0;a--)
  {
  sum=qu+(first[a]-48)+(second[a]-48);

  if(sum>=10)
    {
    qu=sum/10;
    re=sum%10;
    }
  else if(sum<10)
    {
    qu=0;
    re=sum;
    }
  result[i--]=(char)(re+48);
  if(a==0 && qu!=0)
    {
    for(;;)
        {
        x=qu/10;
        y=qu%10;
        result[i--]=char(y+48);
        if(x==0) break;
        qu=x;
        }
    }
  }
j=i+1;
k=MAX-1-j;

for(i=j;i<=MAX;i++)
  result[i-j]=result[i];
result[k+1]='\0';

 len=strlen(result);
 if(len>5)
   printf("result too big\n");
 else if(len==5)
   {
   num=atol(result);

   if(num>MAX_INT)
     printf("result too big\n");
   }
}

void str_mul(char aa[],char bb[],long aa_l,long bb_l)
{
long a,b,temp,i,j,mul1,mul2,x,y,x_max,x_last[MAX],y_final;
long re[MAXSZ][MAXSZ],jj,sum,ii,t,t1,marker,sum1;
char result[5000];

y=0;

x_max=0;
for(b=bb_l-1;b>=0;b--)
  {
  mul1=bb[b]-48;
  x=y;
  j=0;

  for(a=aa_l-1;a>=0;a--)
      {
      mul2=aa[a]-48;
      temp=j+(mul1*mul2);

      if(temp>=10)
           {
           i=temp%10;
           j=temp/10;
           re[y][x]=i;
           }
      else if(temp<10)
           {
           i=temp;
           j=0;
           re[y][x]=i;
           }
      if(a==0)
           {
           x++;
           re[y][x]=j;
           x_last[y]=x;

           }
       if(a!=0)
        x++;
       }
   y++;
   if(x>x_max)
      x_max=x;
   }

  y_final=y;

  for(j=1;j<y_final;j++)
    for(i=0;i<j;i++)
        {
        re[j][i]=0;
        }
  for(j=0;j<y_final;j++)
    for(i=x_last[j]+1;i<=x_max;i++)
        {
        re[j][i]=0;
        }
  jj=0;

  for(i=0;i<=x_max;i++)
    {
    sum=0;
    for(j=0;j<y_final;j++)
      sum+=re[j][i];
      sum+=jj;
    if(sum>=10)
        {
        ii=sum%10;
        jj=sum/10;
        result[i]=(char)(ii+'0');
        }
    else if(sum<10)
        {
        jj=0;
        result[i]=(char)(sum+'0');
        }
    if(i==x_max && jj!=0)
        {
         for(;;)
            {
            t=jj%10;
            result[i++]=(char)(t+'0');

            t1=jj/10;

            if(t1<10)
              {
              result[i++]=(char)(t1+'0');
              break;
              }
            t=t1;
            }
        }
    }


 for(t=i-1;t>=0;t--)
   if(result[t]!='0')
     {
     marker=t;
     break;
     }


 if(marker>4)
 printf("result too big\n");
else if(marker==4)
  {
  sum1=0;
  for(t=marker;t>=0;t--)
    sum1+=(result[t]-'0')*pow(10,t);

  if(sum1>MAX_INT)
   printf("result too big\n");
  }

}