每日一九度之 题目1083：特殊乘法

//Asimple
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cctype>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <limits.h>
#define INF 0x7fffffff
using namespace std;
const int maxn = 55;
typedef long long ll;
ll sum = 0;
char s1[maxn], s2[maxn];
 
int main(){
    while( ~scanf("%s %s",s1, s2) ){
        sum =0;
        for(int i=0; s1[i]!=‘\0‘; i++){
            for(int j=0; s2[j]!=‘\0‘; j++){
                sum += (s1[i]-‘0‘)*(s2[j]-‘0‘);
            }
        }
        printf("%ld\n",sum);
    }
    return 0;
}