CF1066E Binary Numbers AND Sum

思路：

模拟。
实现：

 #include <iostream>
 using namespace std;
 const int MOD = ;
 char a[], b[];
 int sum[];
 int main()
 {
     int n, m;
     while (cin >> n >> m)
     {
         for (int i = n - ; i >= ; i--) cin >> a[i];
         for (int i = m - ; i >= ; i--)
         {
             cin >> b[i];
             sum[i] = sum[i + ] + b[i] - '';
         }
         long long ans = , pw = ;
         for (int i = ; i < n; i++)
         {
             if (a[i] == '')
                 ans = (ans + (sum[i] * pw) % MOD) % MOD;
             pw = pw *  % MOD;
         }
         cout << ans << endl;
     }
     return ;
 }