1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
|
#include<cstdio> #include<cstring> #include<algorithm> #define MAX 105 using namespace std;
int arr[MAX];
int () { char str[MAX]; int cnt,n,m,len,idx,temp,yu; scanf("%d", &cnt); while(cnt--) { len = 0; memset(arr, 0, sizeof(arr)); scanf("%d", &n); for(int i=0; i<n; i++) { scanf("%s", str); m = strlen(str); for(int i=m-1; i>=0; i--) { idx = m - i - 1; temp = arr[idx] + (str[i] - '0') + yu; arr[idx] = temp%10; yu = temp/10; } while(yu) { temp = arr[m] + yu; arr[m] = temp%10; yu = temp/10; m ++; } len = max(len, m); } for(int i=len-1; i>=0; i--) { printf("%d", arr[i]); }printf("n"); } return 0; }
|
近期评论