zoukankan      html  css  js  c++  java
  • 杭电1002-A + B Problem II

    #include<stdio.h>
    #include<string.h>

    int main()
    {
        char str1[1001],str2[1001];
        int t,i,maxlen,len1,len2,k,num=1;
        scanf("%d",&t);
        getchar();
        while(t--)
        {
            int a[1001]={0},b[1001]={0},c[1001]={0};
            scanf("%s",str1);
             len1=strlen(str1);
            for(i=0;i<=len1-1;i++)
            {
               a[i]=str1[len1-i-1]-'0';
            }
            scanf("%s",str2);
             len2=strlen(str2);
            for(i=0;i<=len2-1;i++)
            {
               b[i]=str2[len2-i-1]-'0';
            }
            if(len1>len2)
                 maxlen=len1;
            else
                 maxlen=len2;
            k=0;
            for(i=0;i<=maxlen-1;i++)
            {
               c[i]=(a[i]+b[i]+k)%10;
               k=(a[i]+b[i]+k)/10;
            }
            if(k!=0)
             c[maxlen]=1;
             printf("Case %d: ",num);
             num++;
             printf("%s + %s = ",str1,str2);
             if(c[maxlen]==1)
               printf("1");
             for(i=maxlen-1;i>=0;i--)
               printf("%d",c[i]);
             printf(" ");
             if(t>=1)
                printf(" ");
        }
        return 0;
    }

  • 相关阅读:
    HDU1080(DP)
    hdu1059(多重背包优化)
    Codeforces Round #190 (Div. 2).D
    jQuery的安装
    JDBC-Statement,prepareStatement,CallableStatement的比较
    execute、executeQuery和executeUpdate之间的区别
    Word操作总结
    Excel 操作总结
    notepad 操作总结
    3.CSS使用基础(2)
  • 原文地址:https://www.cnblogs.com/wft1990/p/4320979.html
Copyright © 2011-2022 走看看