{"id":108,"date":"2018-09-09T10:31:00","date_gmt":"2018-09-09T02:31:00","guid":{"rendered":"https:\/\/www.wangliguang.cn\/?p=108"},"modified":"2025-08-05T09:57:23","modified_gmt":"2025-08-05T01:57:23","slug":"hdu1002abproblemii","status":"publish","type":"post","link":"https:\/\/wangliguang.cn\/?p=108","title":{"rendered":"HDU1002 : A + B Problem II"},"content":{"rendered":"

A + B Problem II<\/p>\n

\n Time Limit: 2000\/1000 MS (Java\/Others) Memory Limit: 65536\/32768 K (Java\/Others)
\n Total Submission(s): 367113 Accepted Submission(s): 71500\n<\/p><\/blockquote>\n

Problem Description<\/p>\n

\n I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.\n<\/p><\/blockquote>\n

Input<\/p>\n

\n The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.\n<\/p><\/blockquote>\n

Output<\/p>\n

\n For each test case, you should output two lines. The first line is \u201cCase #:\u201d, # means the number of the test case. The second line is the an equation \u201cA + B = Sum\u201d, Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.\n<\/p><\/blockquote>\n

Sample Input<\/p>\n

\n 2
\n 1 2
\n 112233445566778899 998877665544332211\n<\/p><\/blockquote>\n

Sample Output<\/p>\n

\n Case 1:
\n 1 + 2 = 3
\n Case 2:
\n 112233445566778899 + 998877665544332211 = 1111111111111111110\n<\/p><\/blockquote>\n

\u4ee3\u7801\u5982\u4e0b\uff0c\u90e8\u5206\u4ee3\u7801\u76f4\u63a5\u7528\u4e86\u8001\u5e08\u7684\u8bfe\u4ef6\u4e0a\u7684\uff0c\u66f4\u6b63\u4e86\u9519\u8bef\u3002<\/p>\n

#include<\/span>\n#include<\/span>\n#include<\/span>\n#include<\/span>\n#include<\/span>\nusing<\/span> namespace<\/span> std<\/span>;\nint<\/span> m3[100002<\/span>];\nint<\/span> f = 1<\/span>;\nvoid<\/span> Reverse(char<\/span> *word,int<\/span> len)   \/\/ \u53cd\u8f6c\u6570\u5b57 <\/span>\n{\n    char<\/span> temp;\n    int<\/span> i, j;\n    for<\/span> (j = 0<\/span>, i = len - 1<\/span>; j < i; --i, ++j) {\n        temp = word[i];\n        word[i] = word[j];\n        word[j] = temp;\n    }\n}\nint<\/span> check(int<\/span> a[],int<\/span> num)      \/\/\u5f52\u6574<\/span>\n{  int<\/span> k=0<\/span>,len=num;\n    while<\/span>(a[len-1<\/span>]==0<\/span>&&len>1<\/span>) len--;    \/\/\u53bb\u6389\u524d\u5bfc0<\/span>\n    for<\/span>(k=0<\/span>; kif<\/span>(a[k]>=10<\/span>)\n        {\n          a[k+1<\/span>]=a[k+1<\/span>]+ a[k]\/10<\/span>;  a[k]=a[k] % 10<\/span>;\n        }\n    if<\/span> (a[k]!=0<\/span>) len=k+1<\/span>;  \/\/\u786e\u5b9a\u6570\u7ec4\u6700\u7ec8\u957f\u5ea6<\/span>\n    return<\/span> len;\n}\nint<\/span> addition(int<\/span> m3[], char<\/span> m1[], int<\/span> num1, char<\/span> m2[], int<\/span> num2)\n{\n    int<\/span> i,len1,len2,len;\n    len1=num1;\n    len2=num2;\n    len=(len1>=len2)?len1:len2;     \/\/\u5b9a\u4f4d\u6570<\/span>\n    for<\/span>(i=0<\/span>; i<=len; i++) m3[i]=0<\/span>;   \/\/\u521d\u59cb\u5316<\/span>\n    for<\/span> (i=len1; i1<\/span>; i++) m1[i]='0'<\/span>; \/\/\u7f3a\u4f4d\u524d\u5bfc\u88650<\/span>\n    m1[i] = '\\0'<\/span>;\n    for<\/span> (i=len2; i1<\/span>; i++)    m2[i]='0'<\/span>;\n    m2[i] = '\\0'<\/span>;\n    Reverse(m1,len1);\n    Reverse(m2,len2);\n    for<\/span> (i=0<\/span>; i<=len; i++)\n        m3[i]=(int<\/span>)(m1[i]-'0'<\/span>+m2[i]-'0'<\/span>);   \/\/\u52a0\u6cd5<\/span>\n    len=check(m3,len);\n    return<\/span> len;\n}\nint<\/span> Fun(char<\/span> a[]){   \/\/\u786e\u5b9a\u4f4d\u6570<\/span>\n    int<\/span> i = 0<\/span>;\n    for<\/span>(i = 0<\/span>; a[i] != '\\0'<\/span>; i++);\n    return<\/span> i;  \/\/\u7cbe\u786e\u4f4d\u6570<\/span>\n}\nint<\/span> main(){\n    char<\/span> num1[100001<\/span>],num2[100001<\/span>];\n    int<\/span> m,len1,len2,len;\n    cin<\/span> >> m;\n    while<\/span>(m--){\n        cin<\/span> >> num1 >> num2;\n        len1 = Fun(num1);\n        len2 = Fun(num2);\n        if<\/span>(f != 1<\/span>){\n            cout<\/span> << endl;\n        }\n        cout<\/span> << \"Case \"<\/span> << f << \":\"<\/span> << endl;\n        cout<\/span> << num1 << \" + \"<\/span> << num2 << \" = \"<\/span>;\n        len = addition(m3,num1,len1,num2,len2);\n        for<\/span>(int<\/span> i = len -1<\/span>; i >= 0<\/span>; i--){\n            cout<\/span> << m3[i];\n        }\n        cout<\/span> << endl ;\n        f++;\n    }\n    return<\/span> 0<\/span>;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
A + B Problem II Time Limit: 2000\/1000 MS (Java\/Others)… \u7ee7\u7eed\u9605\u8bfb HDU1002 : A + B Problem II<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[22],"tags":[44],"class_list":["post-108","post","type-post","status-publish","format-standard","hentry","category-22","tag-44"],"_links":{"self":[{"href":"https:\/\/wangliguang.cn\/index.php?rest_route=\/wp\/v2\/posts\/108","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wangliguang.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wangliguang.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wangliguang.cn\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wangliguang.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=108"}],"version-history":[{"count":1,"href":"https:\/\/wangliguang.cn\/index.php?rest_route=\/wp\/v2\/posts\/108\/revisions"}],"predecessor-version":[{"id":679,"href":"https:\/\/wangliguang.cn\/index.php?rest_route=\/wp\/v2\/posts\/108\/revisions\/679"}],"wp:attachment":[{"href":"https:\/\/wangliguang.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=108"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wangliguang.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=108"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wangliguang.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=108"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}