题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=1047

Integer Inquiry

Description

One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.
``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)

Input

The input will consist of at most 100 lines of text, each of which contains a single VeryLongInteger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative).

The final input line will contain a single zero on a line by itself.

Output

Your program should output the sum of the VeryLongIntegers given in the input.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Sample Input

123456789012345678901234567890

Sample Output

370370367037037036703703703670

测模板的。。

 #include<algorithm>

 #include<iostream>

 #include<istream>

 #include<ostream>

 #include<cstdlib>

 #include<cstring>

 #include<cassert>

 #include<cstdio>

 #include<string>

 using std::max;

 using std::cin;

 using std::cout;

 using std::endl;

 using std::swap;

 using std::string;

 using std::istream;

 using std::ostream;

 struct BigN {

     typedef unsigned long long ull;

     static const int Max_N = ;

     int len, data[Max_N];

     BigN() { memset(data, , sizeof(data)), len = ; }

     BigN(const int num) {

         memset(data, , sizeof(data));

         *this = num;

     }

     BigN(const char *num) {

         memset(data, , sizeof(data));

         *this = num;

     }

     void cls() { len = , memset(data, , sizeof(data)); }

     BigN& clean(){ while (len >  && !data[len - ]) len--;  return *this; }

     string str() const {

         string res = "";

         for (int i = len - ; ~i; i--) res += (char)(data[i] + '');

         if (res == "") res = "";

         res.reserve();

         return res;

     }

     BigN operator = (const int num) {

         int j = , i = num;

         do data[j++] = i % ; while (i /= );

         len = j;

         return *this;

     }

     BigN operator = (const char *num) {

         len = strlen(num);

         for (int i = ; i < len; i++) data[i] = num[len - i - ] - '';

         return *this;

     }

     BigN operator + (const BigN &x) const {

         BigN res;

         int n = max(len, x.len) + ;

         for (int i = , g = ; i < n; i++) {

             int c = data[i] + x.data[i] + g;

             res.data[res.len++] = c % ;

             g = c / ;

         }

         while (!res.data[res.len - ]) res.len--;

         return res;

     }

     BigN operator * (const BigN &x) const {

         BigN res;

         int n = x.len;

         res.len = n + len;

         for (int i = ; i < len; i++) {

             for (int j = , g = ; j < n; j++) {

                 res.data[i + j] += data[i] * x.data[j];

             }

         }

         for (int i = ; i < res.len - ; i++) {

             res.data[i + ] += res.data[i] / ;

             res.data[i] %= ;

         }

         return res.clean();

     }

     BigN operator * (const int num) const {

         BigN res;

         res.len = len + ;

         for (int i = , g = ; i < len; i++) res.data[i] *= num;

         for (int i = ; i < res.len - ; i++) {

             res.data[i + ] += res.data[i] / ;

             res.data[i] %= ;

         }

         return res.clean();

     }

     BigN operator - (const BigN &x) const {

         assert(x <= *this);

         BigN res;

         for (int i = , g = ; i < len; i++) {

             int c = data[i] - g;

             if (i < x.len) c -= x.data[i];

             if (c >= ) g = ;

             else g = , c += ;

             res.data[res.len++] = c;

         }

         return res.clean();

     }

     BigN operator / (const BigN &x) const {

         return *this;

     }

     BigN operator += (const BigN &x) { return *this = *this + x; }

     BigN operator *= (const BigN &x) { return *this = *this * x; }

     BigN operator -= (const BigN &x) { return *this = *this - x; }

     BigN operator /= (const BigN &x) { return *this = *this / x; }

     bool operator <  (const BigN &x) const {

         if (len != x.len) return len < x.len;

         for (int i = len - ; ~i; i--) {

             if (data[i] != x.data[i]) return data[i] < x.data[i];

         }

         return false;

     }

     bool operator >(const BigN &x) const { return x < *this; }

     bool operator<=(const BigN &x) const { return !(x < *this); }

     bool operator>=(const BigN &x) const { return !(*this < x); }

     bool operator!=(const BigN &x) const { return x < *this || *this < x; }

     bool operator==(const BigN &x) const { return !(x < *this) && !(x > *this); }

 }res, temp;

 istream& operator >> (istream &in, BigN &x) {

     string src;

     in >> src;

     x = src.c_str();

     return in;

 }

 ostream& operator << (ostream &out, const BigN &x) {

     out << x.str();

     return out;

 }

 int main() {

 #ifdef LOCAL

     freopen("in.txt", "r", stdin);

     freopen("out.txt", "w+", stdout);

 #endif

     int t;

     char buf[];

     scanf("%d", &t);

     while (t--) {

         while (~scanf("%s", buf) && strcmp(buf, "")) {

             if (!strcmp(buf, "")) continue;

             temp = buf, res = res + temp, temp.cls();

         }

         cout << res << endl;

         if (t) cout << endl;

         res.cls();

     }

     return ;

 }

巴特西

hdu 1047 Integer Inquiry