malteklaes/cpp-code-code_search_net-style huggingface dataset:
#include <bits/stdc++.h>   using namespace std;   vector<pair<int, int> > Div[5 * int(1e5 + 100)];   int a[2 * int(1e5 + 100)];   bool Have[2 * int(1e5 + 100)];   int calc[5 * int(1e5 + 100)];   int root[5 * int(1e5 + 100)];   int val = 1;   void Prime(int x) {     int u = x;     root[x] = 1;     for (int i = 2; i <= sqrt(x); i++)       if (x % i == 0) {         Div[u].push_back(pair<int, int>(i, 1));         while (x % i == 0) x /= i;         root[u] *= i;       }     if (x > 1) {       Div[u].push_back(pair<int, int>(x, 1));       root[u] *= x;     }   }   void Generate(int x, int n, int maxnumber, int number, int pos) {     if (number > maxnumber) {       Div[x].push_back(pair<int, int>(val, maxnumber));       return;     }     for (int j = pos; j <= n - (maxnumber - number); j++) {       val *= Div[x][j].first;       Generate(x, n, maxnumber, number + 1, j + 1);       val /= Div[x][j].first;     }   }   int main() {     for (int i = 2; i <= 5e5; i++) {       Prime(i);       if (i != root[i]) Div[i].clear();     }     for (int i = 2; i <= 5e5; i++)       if (i == root[i]) {         int n = Div[i].size();         for (int j = 2; j <= n; j++) Generate(i, n - 1, j, 1, 0);       }     int n, q;     cin >> n >> q;     for (int i = 0; i < n; i++) scanf( %d , &a[i]);     int Size = 0;     long long ans = 0;     for (int i = 1; i <= q; i++) {       int x, base;       scanf( %d , &x);       x--;       if (!Have[x]) {         Have[x] = true;         base = 1;         ans += 1ll * Size;         Size++;       } else {         Have[x] = false;         base = -1;         Size--;         ans -= 1ll * Size;       }       for (int j = 0; j < Div[root[a[x]]].size(); j++) {         int base2;         if (Div[root[a[x]]][j].second % 2 == 1)           base2 = -1;         else           base2 = 1;         if (base == -1) calc[Div[root[a[x]]][j].first]--;         ans = ans + (1ll * base * base2 * calc[Div[root[a[x]]][j].first]);         if (base == 1) calc[Div[root[a[x]]][j].first]++;       }       printf( %I64d n , ans);     }   }
#include <bits/stdc++.h>   using namespace std;   map<float, int> mp;   float cnt[200005];   int main() {     int m;     cin >> m;     for (int i = 1; i <= m; i++) {       char s1, s2, s3, s4;       int a, b, c;       cin >> s1 >> a >> s2 >> b >> s3 >> s4 >> c;       cnt[i] = (((a + b) * 1.0) / c);       mp[cnt[i]]++;     }     for (int i = 1; i <= m; i++) {       if (i == m)         cout << mp[cnt[i]] << endl;       else         cout << mp[cnt[i]] <<    ;     }   }
#include <bits/stdc++.h>   using namespace std;   int T, n, a[100005], b[100005], f[22], F[22], u[22], m, dp[2222222],       cnt[2222222], C;   void ope(int x) {     dp[x] = 0;     for (int i = 1; i <= 20; ++i) {       if ((1 << i) & x) {         int y = x ^ (1 << i);         if (dp[y] == -1) ope(y);         if (!(y & f[i])) dp[x] |= dp[y];       }     }     if (dp[x]) C = max(C, cnt[x]);   }   void dfs(int x) {     u[x] = 1;     m |= (1 << x);     for (int i = 1; i <= 20; ++i)       if (!u[i] && (F[x] & (1 << i))) dfs(i);   }   int main() {     for (int i = 1; i < 2222000; ++i) {       if (i & 1)         cnt[i] = cnt[i >> 1] + 1;       else         cnt[i] = cnt[i >> 1];     }     scanf( %d , &T);     while (T--) {       scanf( %d , &n);       for (int i = 1; i <= n; ++i) {         char c;         scanf(  %c , &c);         a[i] = c - 96;       }       for (int i = 1; i <= n; ++i) {         char c;         scanf(  %c , &c);         b[i] = c - 96;       }       memset(f, 0, sizeof(f));       memset(F, 0, sizeof(F));       for (int i = 1; i <= n; ++i)         if (a[i] != b[i]) f[a[i]] |= (1 << b[i]), F[b[i]] |= (1 << a[i]);       for (int i = 1; i <= 20; ++i) F[i] |= f[i];       memset(u, 0, sizeof(u));       memset(dp, -1, sizeof(dp));       dp[0] = 1;       int ans = 0;       for (int i = 1; i <= 20; ++i) {         if (!u[i]) {           m = 0;           C = 0;           dfs(i);           ope(m);           ans += cnt[m] * 2 - 1 - C;         }       }       printf( %d n , ans);     }     return 0;   }
#include <bits/stdc++.h>   #pragma comment(linker,  /STACK:16777216 )   using namespace std;   int a, b, c, d, i, j, n, m, k, ans, T;   char str[200003];   int p[22], cs[22][22], dp[1 << 22];   pair<int, int> cur[26];   int main() {     scanf( %d%d%d , &n, &k, &T);     scanf( %s , str);     for (int _n((k)-1), i(0); i <= _n; i++) scanf( %d , &p[i]);     for (int _n((k)-1), i(0); i <= _n; i++)       for (int _n((k)-1), j(0); j <= _n; j++) scanf( %d , &cs[i][j]);     cur[0] = make_pair(-1, -1);     int were = 0;     for (int i = (n - 1), _b = (0); i >= _b; i--) {       int mask = 0, t = str[i] -  A ;       were |= 1 << t;       for (int _n((k)-1), j(0); j <= _n; j++) {         if (cur[j].first == -1) break;         dp[mask] += cs[t][cur[j].second];         dp[mask | 1 << t] -= cs[t][cur[j].second];         dp[mask | 1 << cur[j].second] -= cs[t][cur[j].second];         dp[mask | (1 << t) | (1 << cur[j].second)] += cs[t][cur[j].second];         mask |= 1 << cur[j].second;         if (cur[j].second == t) break;       }       for (int _n((k)-1), j(0); j <= _n; j++) {         if (cur[j].first == -1 || cur[j].second == t) {           bool tt = 0;           if (cur[j].first == -1) tt = 1;           cur[j] = make_pair(i, t);           for (int z = (j - 1), _b = (0); z >= _b; z--) swap(cur[z], cur[z + 1]);           if (tt) cur[j + 1] = make_pair(-1, -1);           break;         }       }     }     ans = 0;     for (int _n((k)-1), i(0); i <= _n; i++) {       for (int _n((were)-1), mask(0); mask <= _n; mask++) {         if ((mask & were) != mask) continue;         if (mask & 1 << i) dp[mask] += dp[mask ^ 1 << i];       }     }     for (int _n((were)-1), mask(0); mask <= _n; mask++) {       if ((mask & were) != mask) continue;       c = dp[mask];       for (int _n((k)-1), i(0); i <= _n; i++)         if (mask & 1 << i) c += p[i];       if (c <= T) ++ans;     }     printf( %d n , ans);   }
#include <bits/stdc++.h>   using namespace std;   int n, m, p = 1000000;   bool checkDias(int a, const vector<unsigned long long int> &v) {     for (int i = p; i < n + 1; i += 1) {       unsigned long long int d = i / a;       unsigned long long int r = i % a;       if (v[i] >= (unsigned long long int)m + r * (d + 1) * d / 2 +                       (a - r) * d * (d - 1) / 2)         return true;     }     return false;   }   int main() {     cin >> n >> m;     vector<int> vect(n);     vector<unsigned long long int> sumasparciales(n + 1, 0);     for (int i = 0; i < n; i += 1) {       cin >> vect[i];     }     sort(vect.begin(), vect.end(), greater<int>());     for (int i = 0; i < n; i += 1) {       sumasparciales[i + 1] = sumasparciales[i] + vect[i];       if (sumasparciales[i + 1] >= m && i + 1 < p) p = i + 1;     }     if (sumasparciales[n] < m) {       cout << -1 << endl;       return 0;     }     int i = 1;     int j = m;     int minimo = m + 10;     while (i <= j) {       int nepe = (i + j) / 2;       if (checkDias(nepe, sumasparciales)) {         j = nepe - 1;         minimo = min(minimo, nepe);       } else         i = nepe + 1;     }     cout << minimo << endl;   }
#include <bits/stdc++.h>   using namespace std;   const double EPS = 1e-6;   const long long mod = 1000000007ll;   const long long mod1 = 1000000009ll;   const long long mod2 = 1100000009ll;   const double PI = 3.14159265359;   const long long MX = 1000000000000ll;   int INF = 2147483645;   long long INFINF = (long long)1e18;   using namespace std;   template <class T>   T Max2(T a, T b) {     return a < b ? b : a;   }   template <class T>   T Min2(T a, T b) {     return a < b ? a : b;   }   template <class T>   T Max3(T a, T b, T c) {     return Max2(Max2(a, b), c);   }   template <class T>   T Min3(T a, T b, T c) {     return Min2(Min2(a, b), c);   }   template <class T>   T Max4(T a, T b, T c, T d) {     return Max2(Max2(a, b), Max2(c, d));   }   template <class T>   T Min4(T a, T b, T c, T d) {     return Min2(Min2(a, b), Max2(c, d));   }   template <class T>   void swap(T &a, T &b) {     T c = b;     b = a;     a = c;   }   long long bit_count(long long _x) {     long long _ret = 0;     while (_x) {       if (_x % 2 == 1) _ret++;       _x /= 2;     }     return _ret;   }   long long bit(long long _mask, long long _i) {     return (_mask & (1 << _i)) == 0 ? 0 : 1;   }   long long powermod(long long _a, long long _b, long long _m) {     long long _r = 1;     while (_b) {       if (_b % 2 == 1) _r = (_r * _a) % _m;       _b /= 2;       _a = (_a * _a) % _m;     }     return _r;   }   long long add(long long a, long long b, long long m) {     long long x = a + b;     while (x >= m) x -= m;     return x;   }   long long sub(long long a, long long b, long long m) {     long long x = a - b;     while (x < 0) x += m;     return x;   }   long long mul(long long a, long long b, long long m) {     long long x = a * b;     x %= m;     return x;   }   int main() {     ios::sync_with_stdio(false);     cin.tie(NULL);     int q, n;     cin >> q;     for (int i = 0; i < int(q); i++) {       cin >> n;       vector<int> a(n);       for (int i = 0; i < int(n); i++) {         cin >> a[i];       }       sort(a.begin(), a.end());       int f = 0;       for (int i = 0; i < int(n - 1); i++) {         if (a[i + 1] - a[i] == 1) {           f = 1;           break;         }       }       if (f)         cout << 2 << endl;       else         cout << 1 << endl;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int n, x = 0;     cin >> n;     while (n > 0) {       if (n >= 100) {         x += n / 100;         n %= 100;       } else if (n >= 20 && n < 100) {         x += n / 20;         n %= 20;       } else if (n >= 10 && n < 50) {         x += n / 10;         n %= 10;       } else if (n >= 5 && n < 10) {         x += n / 5;         n %= 5;       } else {         x += n;         n = 0;       }     }     cout << x;   }
#include <bits/stdc++.h>   using namespace std;   bool check(int c1, int c2, int c3, int v1, int v2, int v3, int m) {     return (c1 >= v1 && c1 <= 2 * v1 && c2 >= v2 && c2 <= 2 * v2 && c3 >= v3 &&             c3 <= 2 * v3 && 2 * m >= c3 && 2 * m < c2 && c3 < c2 && c2 < c1 &&             m <= c3);   }   int main() {     int v1, v2, v3, m;     cin >> v1 >> v2 >> v3 >> m;     for (int i = 1; i <= 200; i++) {       for (int j = i + 1; j <= 200; j++) {         for (int k = j + 1; k <= 200; k++) {           if (check(k, j, i, v1, v2, v3, m)) {             cout << k << endl;             cout << j << endl;             cout << i << endl;             return 0;           }         }       }     }     cout << -1 << endl;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   template <typename A, typename B, typename C>   struct triple {     A X;     B Y;     C Z;     triple(A a = 0, B b = 0, C c = 0) : X(a), Y(b), Z(c) {}   };   template <typename A, typename B, typename C>   triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {     return triple<A, B, C>(a, b, c);   }   template <typename A, typename B, typename C>   bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {     if (a.X != b.X) return a.X < b.X;     if (a.Y != b.Y) return a.Y < b.Y;     return a.Z < b.Z;   }   template <typename T, typename SS>   ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {     ofs <<  (   << p.first <<   ,   << p.second <<   ) ;     return ofs;   }   template <typename T>   void print(T a) {     for (auto i : a) cout << i <<    ;     cout <<   n ;   }   template <typename T>   T max(T a, T b, T c) {     return max(a, max(b, c));   }   template <typename T>   T min(T a, T b, T c) {     return min(a, max(b, c));   }   vector<vector<long long> > g;   vector<long long> h;   vector<long long> p;   void dfs(long long v, long long hh = 0, long long pp = -1) {     h[v] = hh;     for (auto to : g[v])       if (to != pp) {         p[to] = v;         dfs(to, hh + 1, v);       }   }   signed main() {     srand(time(NULL));     cin.tie(0);     cout.tie(0);     ios_base::sync_with_stdio(false);     long long n;     cin >> n;     g.resize(n);     p.resize(n);     h.resize(n);     for (long long _ = 0; _ < (n - 1); _++) {       long long x, y;       cin >> x >> y;       x--, y--;       g[x].push_back(y);       g[y].push_back(x);     }     dfs(0);     set<pair<long long, long long> > need;     for (long long i = 0; i < n; i++)       if (h[i] > 2) need.insert(make_pair(-h[i], i));     long long ans = 0;     while (need.size()) {       long long x = need.begin()->second;       long long y = p[x];       if (need.count(make_pair(-h[y], y))) need.erase(make_pair(-h[y], y));       for (auto to : g[y])         if (need.count(make_pair(-h[to], to))) need.erase(make_pair(-h[to], to));       ans++;     }     cout << ans <<   n ;   }
#include <bits/stdc++.h>   using namespace std;   bool comp[30000];   int P[30000];   int seive(int n, int* P) {     int p, q, K = 0;     comp[1] = true;     char even = 1;     for (p = 2; p * p <= n; p += 2) {       if (!comp[p]) {         for (q = p * p; q <= n; q += p * (2 - even)) comp[q] = true;       }       if (p == 2) --p, even = 0;     }     for (int i = (1); i <= (n); ++i)       if (!comp[i]) P[K++] = i;     return K;   }   int muls[30000];   int has[30000];   int main() {     int K;     cin >> K;     int lim = 2 * K * K;     int least = (K + 1) / 2;     vector<int> ans;     ans.push_back(1);     int max_added = 0;     int L = seive(5 * K, P);     for (int l = 0; l < L && ((int)ans.size()) < K; ++l) {       for (int l2 = 0; l2 < (l); ++l2) {         has[l2] = 0;         for (int i = 0; i < (((int)ans.size())); ++i)           if (!(ans[i] % P[l2])) ++has[l2];       }       int p = P[l];       set<int> tmp;       for (long long q = p; q <= lim; q *= p) {         for (int i = 0; i < ((int)ans.size()) && (ans[i] % p); ++i) {           long long new_num = 1ll * q * ans[i];           if (new_num <= lim) {             tmp.insert(new_num);           }         }       }       set<int>::iterator it = tmp.begin();       for (int i = 0; it != tmp.end() && i < least; ++it) {         int v = *it;         assert(!(v % p));         for (int j = 0; j < (l); ++j)           if (!(v % P[j])) ++has[j];         if (((int)ans.size()) < K) {           ans.push_back(v);         } else {           bool found = false;           for (int j = (K - 1); j >= (0); --j) {             int w = ans[j];             bool good = true;             for (int h = (0); h <= (l); ++h) {               int& pr = P[h];               if (!(w % pr)) {                 if (has[h] <= least) {                   good = false;                   break;                 }               }             }             if (good) {               for (int h = (0); h <= (l - 1); ++h) {                 int& pr = P[h];                 if (!(w % pr)) {                   has[h]--;                 }               }               assert(ans[j] % p);               ans[j] = v;               found = true;               break;             }           }           assert(found);           assert(ans.size() == K);         }         ++i;       }       assert(((int)ans.size()) <= K);     }     assert(((int)ans.size()) == K);     sort(ans.begin(), ans.end());     ans.erase(unique(ans.begin(), ans.end()), ans.end());     assert(((int)ans.size()) == K);     for (int l = 0; l < (L); ++l) {       int cnt = 0;       for (int i = 0; i < ((int)ans.size()); ++i)         if (!(ans[i] % P[l])) {           ++cnt;         }       assert(cnt == 0 || cnt >= least);     }     for (int i = 0; i < (((int)ans.size())); ++i) assert(ans[i] <= lim);     for (int i = 0; i < (K); ++i) {       if (i > 0) printf(   );       printf( %d , ans[i]);     }     printf(  n );   }
#include <bits/stdc++.h>   const long long int inf = 9e18;   const long double pi = 2 * acos(0.0);   using namespace std;   long long int power(long long int a, long long int n) {     if (n == 0) {       return 1;     }     long long int p = power(a, n / 2) % 998244353;     p = (p * p) % 998244353;     if (n % 2 == 1) {       p = (p * a) % 998244353;     }     return p;   }   long long int gcd(long long int a, long long int b) {     if (a == 0) return b;     return gcd(b % a, a);   }   int isprime(long long int n) {     for (long long int i = 2; i <= sqrt(n); i++) {       if (n % i == 0) {         return 0;       }     }     return 1;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     ;     long long int t;     cin >> t;     while (t--) {       long long int n;       cin >> n;       if (n >= 15) {         n = n % 14;         if (n <= 6 && n >= 1) {           cout <<  YES                 <<   n ;         } else {           cout <<  NO                 <<   n ;         }       } else {         cout <<  NO               <<   n ;       }     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   inline int read() {     int s = 0, w = 1;     char ch = getchar();     while (ch <  0  || ch >  9 ) {       if (ch ==  - ) w = -1;       ch = getchar();     }     while (ch >=  0  && ch <=  9 ) s = s * 10 + ch -  0 , ch = getchar();     return s * w;   }   vector<int> v;   signed main() {     int n = read(), k = read() % 64, x = read();     for (int i = 1, x; i <= n; i++) x = read(), v.push_back(x);     while (k--) {       sort(v.begin(), v.end());       for (int i = 0; i < n; i += 2) v[i] ^= x;     }     sort(v.begin(), v.end());     printf( %d %d n , v[n - 1], v[0]);     return 0;   }
#include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   using namespace std;   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     string s;     int temp;     long long sol = 0;     cin >> s;     if ((s[0] -  0 ) % 4 == 0) {       sol++;     }     for (int a = s.length() - 1; a > 0; a--) {       temp = (s[a] -  0 ) + 10 * (s[a - 1] -  0 );       if (temp % 4 == 0) {         sol += a;       }       if ((s[a] -  0 ) % 4 == 0) {         sol++;       }     }     cout << sol <<   n ;     cerr <<   nTime elapsed:   << 1000 * clock() / CLOCKS_PER_SEC <<  ms n ;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int s[200010], univ[200010];   int n, k, n_univ;   vector<int> edges[200010];   bool visited[200010];   int dist[200010];   int getSum(int node) {     int sum = univ[node];     visited[node] = true;     for (auto e : edges[node]) {       if (!visited[e]) sum += getSum(e);     }     s[node] = sum;     return sum;   }   int dfs(int node) {     visited[node] = true;     for (auto e : edges[node]) {       if (visited[e]) continue;       if (s[e] * 2 > n_univ) {         return dfs(e);       }     }     return node;   }   long long getAns(int centroid) {     queue<pair<int, int> > q;     memset(visited, 0, sizeof(visited));     q.push(make_pair(centroid, 0));     visited[centroid] = true;     while (!q.empty()) {       pair<int, int> node = q.front();       q.pop();       dist[node.first] = node.second;       for (int e : edges[node.first]) {         if (!visited[e]) {           visited[e] = true;           q.push(make_pair(e, node.second + 1));         }       }     }     long long sum = 0;     for (int i = 0; i < n; i++) {       if (univ[i]) sum += dist[i];     }     return sum;   }   int main() {     cin >> n >> k;     n_univ = k + k;     for (int i = 0; i < n_univ; i++) {       int x;       cin >> x;       x--;       univ[x] = 1;     }     for (int i = 0; i < n - 1; i++) {       int v1, v2;       cin >> v1 >> v2;       v1--;       v2--;       edges[v1].push_back(v2);       edges[v2].push_back(v1);     }     getSum(0);     memset(visited, 0, sizeof(visited));     cout << getAns(dfs(0)) << endl;   }
#include <bits/stdc++.h>   int main() {     char n[101], a[4] =  127 , b[6] =  32767 , c[11] =  2147483647 ,                  d[20] =  9223372036854775807 ;     int i, l, count, mark;     while (~scanf( %s , n)) {       l = strlen(n);       if (l < 3) {         printf( byte n );         continue;       }       if (l == 3) {         mark = 1;         for (i = 0; i < l; i++) {           if (n[i] > a[i]) break;           if (n[i] < a[i]) {             mark = 0;             break;           }           if (i == l - 1) {             if (n[i] == a[i]) mark = 0;           }         }         if (mark == 0)           printf( byte n );         else           printf( short n );         continue;       }       if (l == 4) {         printf( short n );         continue;       }       if (l == 5) {         mark = 1;         for (i = 0; i < l; i++) {           if (n[i] > b[i]) break;           if (n[i] < b[i]) {             mark = 0;             break;           }           if (i == l - 1) {             if (n[i] == b[i]) mark = 0;           }         }         if (mark == 0)           printf( short n );         else           printf( int n );         continue;       }       if (l <= 9) {         printf( int n );         continue;       }       if (l == 10) {         mark = 1;         for (i = 0; i < l; i++) {           if (n[i] > c[i]) break;           if (n[i] < c[i]) {             mark = 0;             break;           }           if (i == l - 1) {             if (n[i] == c[i]) mark = 0;           }         }         if (mark == 0)           printf( int n );         else           printf( long n );         continue;       }       if (l < 19) {         printf( long n );         continue;       }       if (l == 19) {         mark = 1;         for (i = 0; i < l; i++) {           if (n[i] > d[i]) break;           if (n[i] < d[i]) {             mark = 0;             break;           }           if (i == l - 1) {             if (n[i] == d[i]) mark = 0;           }         }         if (mark == 0)           printf( long n );         else           printf( BigInteger n );         continue;       }       printf( BigInteger n );     }   }
#include <bits/stdc++.h>   using namespace std;   string second[100];   int x[100], y[100];   vector<int> a, b;   bool u[100][100];   bool uu[100][100];   bool ux[100], uy[100];   int n, m;   void dfs(int x, int y) {     ux[x] = uy[y] = true;     u[x][y] = true;     for (int i = 0; i < n; i++)       if (second[i][y] ==  #  && !u[i][y]) dfs(i, y);     for (int j = 0; j < m; j++)       if (second[x][j] ==  #  && !u[x][j]) dfs(x, j);   }   int main() {     cin >> n >> m;     for (int i = 0; i < n; i++) cin >> second[i];     for (int i = 0; i < n; i++)       for (int j = 0; j < m; j++)         if (second[i][j] ==  #  && !u[i][j]) {           for (int i = 0; i < n; i++) ux[i] = false;           for (int i = 0; i < m; i++) uy[i] = false;           dfs(i, j);           a.clear();           b.clear();           for (int i = 0; i < n; i++)             if (ux[i]) a.push_back(i);           for (int j = 0; j < m; j++)             if (uy[j]) b.push_back(j);           for (int i = 0; i < n; i++)             for (int j = 0; j < m; j++) uu[i][j] = false;           for (int i = 0; i < a.size(); i++)             for (int j = 0; j < b.size(); j++) {               uu[a[i]][b[j]] = true;             }           for (int i = 0; i < n; i++)             for (int j = 0; j < m; j++) {               if (ux[i] && second[i][j] ==  #  && !uu[i][j]) {                 cout <<  No ;                 return 0;               }               if (second[i][j] ==  .  && uu[i][j]) {                 cout <<  No ;                 return 0;               }             }         }     cout <<  Yes ;     return 0;   }