UVA_If We Were a Child Again

Description

 

If We Were a Child Again

“Oooooooooooooooh!
If I could do the easy mathematics like my school
days!!
I can guarantee, that I’d not make any mistake this
time!!”
Says a smart university student!!
But his teacher even smarter – “Ok! I’d assign you
such projects in your software lab. Don’t be so sad.”
“Really!!” - the students feels happy. And he feels so
happy that he cannot see the smile in his teacher’s
face.



The Problem

The first project for the poor student was to make a calculator that can just perform the basic
arithmetic operations.

But like many other university students he doesn’t like to do any project by himself. He just wants to
collect programs from here and there. As you are a friend of him, he asks you to write the program.
But, you are also intelligent enough to tackle this kind of people. You agreed to write only the
(integer) division and mod (% in C/C++) operations for him.

Input
Input is a sequence of lines. Each line will contain an input number. One or more spaces. A sign
(division or mod). Again spaces. And another input number. Both the input numbers are non-negative
integer. The first one may be arbitrarily long. The second number n will be in the range (0 < n < 231).


Output
A line for each input, each containing an integer. See the sample input and output. Output should not
contain any extra space.

---

Problemsetter:  S. M. Ashraful Kadir, University of Dhaka

 

 

题意：大数除小数；大数模小数问题；

这里0 < n < 2^{31 ;}

n用long long就行了；

 

注意：模板里面一起同步将int 改为 long long ;

 

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define UNIT 10

using namespace std;

struct Bignum
{
    long long val[10000];
    int len;

    Bignum ()
    {
        memset (val, 0, sizeof(val));
        len = 1;
    }

    Bignum operator / (const long long &a) const//大数除小数
    {
        Bignum x;
        long long down = 0;
        for (int i = len-1; i >= 0; --i)
        {
            x.val[i] = (val[i]+down*UNIT) / a;
            down = val[i] + down*UNIT - x.val[i]*a;
        }
        x.len = len;
        while (x.val[x.len-1] == 0 && x.len > 1)
            x.len--;
        return x;
    }

    long long operator % (const long long &a) const//大数模小数
    {
        int x = 0;
        for (int i = len-1; i >= 0; --i)
            x = ((x*UNIT)%a+val[i]) % a;
        return x;
    }


};


char a[10000],ch;
long long b;
int main()
{
    //freopen("ACM.txt","r",stdin);

    while(scanf("%s %c %lld", a, &ch, &b)!=EOF)
    {
       // printf("%c",ch);
        Bignum x1,ans;
        int La=strlen(a);
        x1.len=0;
        for(int i=La-1;i>=0;i--)
        x1.val[x1.len++]=a[i]-'0';
       // cout<<ch<<b<<endl;
        if(ch=='/')
        {
            ans=x1/b;
            for(int i=ans.len-1;i>=0;i--)
            cout<<ans.val[i];
            cout<<endl;
        }
        else if(ch=='%')
        {
            cout<<x1%b<<endl;
        }
    }
    return 0;
}