POJ 3673 Cow Multiplication (水题)

#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
using namespace std ;

typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f3f;
const double eps = 1e-8;
const int maxn = 1000 + 5;
const int dr[] = {0, 0, -1, 1};
const int dc[] = {-1, 1, 0, 0};
int m, n;
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}

int main(){
    while(scanf("%d %d", &n, &m) == 2){
        int a[15], b[15];
        int cnt1 = 0, cnt2 = 0;
        while(n){
            a[cnt1++] = n % 10;
            n /= 10;
        }
        while(m){
            b[cnt2++] = m % 10;
            m /= 10;
        }
        int ans = 0;
        for(int i = 0; i < cnt1; ++i)
            for(int j = 0; j < cnt2; ++j)
                ans += a[i] * b[j];
        printf("%d\n", ans);
    }
    return 0;
}