POJ 3673 Cow Multiplication

输入两个整数，求前一个各位数字与后一个各位数字乘积的和。

呃，我是输入了两个int型，然后转成字符串，其实直接输入字符串就可以……

就当是复习一下吧char a[12];int A;     cin>>A;     sprintf (a,"%d",A);

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<sstream>
#define CPY(A,B)memcpy(A,B,sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const LL INFF=0x3f3f3f3f3f3f3f3fLL;
const double EPS=1e-9;
const double OO=1e20;
const double PI=acos (-1.0);
int dx[]= {0,1,0,-1};
int dy[]= {1,0,-1,0};
int gcd (const LL &a,const LL &b) {return b==0?a:gcd (b,a%b);}
using namespace std;
char a[12],b[12];
int main() {
    int A,B;
    while (~scanf ("%d%d",&A,&B) ) {
        int ans=0;
        sprintf (a,"%d",A);/***/
        sprintf (b,"%d",B);
        int lena=strlen (a);
        int lenb=strlen (b);
        for (int i=0; i<lena; ++i) {
            for (int j=0; j<lenb; ++j) {
                ans+= (a[i]-'0') * (b[j]-'0');
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}