13 条题解

  • 0
    @ 2023-11-25 20:10:58

    #include #include #include #include #include #include #include using namespace std; const int N =1e5+10; string a , b; int lena , lenb , lenc , a1[N] , b1[N] , c1[N] , x; int main() { cin>>a>>b; lena = a.size(); lenb = b.size(); for(int i = 1;i <= lena;i++) { a1[i] = a[lena - i] - '0'; } for(int i = 1;i <= lenb;i++) { b1[i] = b[lenb - i] - '0'; } for(int i = 1;i <= lenb;i++) { x = 0; for(int j = 1;j<= lena;j++) { c1[i + j - 1] += a1[j] * b1[i] + x; x = c1[i + j - 1] / 10; c1[i + j - 1] %= 10; } c1[i + lena] = x; } lenc = lena + lenb; while(c1[lenc] == 0 && lenc > 1) { lenc--; } for(int i = lenc;i >= 1;i--) { cout<<c1[i]; } return 0; }

    • [ ] > ````````````````````````````````````````````````````````````````````````````````````````````````**************

      **************
      
      
      **********
      
      ******
      
      **
      
      
      
    
    
    
    

    信息

    ID
    1187
    时间
    1000ms
    内存
    128MiB
    难度
    6
    标签
    递交数
    663
    已通过
    202
    上传者