#include<iostream>
#include<cstring>
using namespace std;

int main()
{
          int t;
          int number1[1000001];
          int number2[1000001];
          int* result;

         while(scanf("%d",&t) != EOF)
        {
              for(int i=0;i<t;i++)
             {
                   int digit;
                   scanf("%d",&digit);
   
                   result=new int[digit];

                   int j;
                   for(j=0;j<digit;j++)
                         scanf("%d %d",&number1[j],&number2[j]);

                  int carry=0;
                  j--;
                 while(j>=0)
                {
                     result[j]=number1[j]+number2[j]+carry;
                     if(result[j]>9)
                            carry=1;
                     else
                            carry=0;

                    result[j]%=10;

                    j--;
                }

                for(int k=0;k<digit;k++)
                           cout << result[k];
                cout << endl;
                delete []result;
 

            }
       }

    //system("pause");
    return 0;
}
    

以上是我的程式碼，想詢問各位高手們

這這要如何加速?? 看了有人80ms就完成了

 想要麻煩高手們指點迷津，謝謝^^