UVA 10494 If We Were a Child Again

UVA-10494

题意：求给出的式子的结果。
解题思路：只有 / 和 % 2种运算。n保证小于2^31，高精除普通整数，记住余数和商，看题目要哪个就输出哪个。

/*************************************************************************    > File Name: UVA-10494.cpp    > Author: Narsh    >     > Created Time: 2016年07月19日 星期二 09时46分08秒 ************************************************************************/#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>using namespace std;int p[6000],l,t,ans[6000],la;long long n,leave;string s;int main() {    while (cin>>s) {        l=s.length();        for (int i = 1; i <= l; i++)            p[i] = s[i-1] - '0';        cin>>s>>n;        leave=0;        la=0;        t=1;        while (t <= l) {            la++;            leave=leave*10+p[t];            ans[la] = leave / n;            leave %=n;            t++;        }        if (s[0] == '%') printf("%lld\n",leave);        else {            int h=1;            while (ans[h] == 0 && h < la) h++;            for (int i = h; i <= la; i++)                printf("%d",ans[i]);            printf("\n");        }    }}