特殊乘法

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<cmath>
#include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<map>
using namespace std;
 
typedef long long LL;
const int N=1e5+10,mod=1e6;
const int MAX = 1e8 + 10 ;

int a[100] ;
int b[100] ;

void solve(int n , int m){
	memset(a,0,sizeof(a)) ;
	memset(b,0,sizeof(b)) ;
	int na = 0 , nb = 0 ;
	while(n){
		a[na] = n % 10 ;
		na ++ ;
		n /= 10 ;
	}
	while(m){
		b[nb] = m%10 ;
		nb++ ;
		m /= 10;
	}
	
	int sum  = 0;
	for(int i = 0 ; i < na; i++){
		for(int j= 0 ; j <nb ; j++){
			sum += a[i] * b[j] ;
		}
	}
	cout << sum <<endl;
}
int main(){
	int  n ,m ;
	while(cin >>n>> m){
		solve(n,m) ;
	}
}