malteklaes/cpp-code-code_search_net-style huggingface dataset:
#include <bits/stdc++.h>   using namespace std;   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     long long n;     cin >> n;     vector<pair<long long, long long> > p;     for (long long i = 0; i < n; i++) {       double x, y;       cin >> x >> y;       p.push_back(make_pair(x, y));     }     set<pair<double, double> > s;     set<double> e;     long long c;     for (long long i = 0; i < n; i++) {       for (long long j = i + 1; j < n; j++) {         double x1 = p[i].first;         double y1 = p[i].second;         double x2 = p[j].first;         double y2 = p[j].second;         if ((x2 - x1) != 0) {           double m = (y2 - y1) / (x2 - x1);           double c = y1 - m * (x1);           s.insert(make_pair(m, c));         } else {           e.insert(x1);         }       }     }     set<pair<double, double> >::iterator it;     vector<long long> r;     long long k = 0;     long long w = 0;     set<pair<double, double> >::iterator itr;     itr = s.begin();     it = s.begin();     it++;     while (it != s.end()) {       long long u = 0;       pair<double, double> gg = *it;       pair<double, double> hh = *itr;       while (gg.first == hh.first) {         u++;         it++;         itr++;         gg = *it;         hh = *itr;       }       if (u != 0) {         w = w + ((u + 1) * u) / 2;       }       it++;       itr++;     }     c = e.size();     long long total = s.size() + c;     total = (total * (total - 1)) / 2;     w = w + ((c - 1) * c) / 2;     cout << (total - w);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int maxn = 2e5 + 10;   int a[maxn], used[maxn], change[maxn];   int n, m, odd, even, sz, ans;   int o = 0, e = 0;   map<int, int> id;   int num[maxn];   int main(void) {     scanf( %d%d , &n, &m);     for (int i = 1; i <= n; i++) {       scanf( %d , &a[i]);       if (a[i] % 2 == 0)         even++;       else         odd++;       if (!id[a[i]]) id[a[i]] = ++sz;       num[id[a[i]]]++;     }     for (int i = 1; i <= n; i++) {       if (num[id[a[i]]] > 1) {         change[i] = true;         num[id[a[i]]]--;         if (a[i] % 2 == 0)           even--;         else           odd--;         ans++;       }     }     for (int i = 1; i <= n; i++)       if (!change[i]) {         if (odd > n / 2 && a[i] % 2 == 1) {           change[i] = true;           num[id[a[i]]]--;           odd--;           ans++;         } else if (even > n / 2 && a[i] % 2 == 0) {           change[i] = true;           num[id[a[i]]]--;           even--;           ans++;         }       }     for (int i = 1; i <= n; i++)       if (change[i]) {         if (odd < n / 2) {           if (o == 0) o = 1;           while (id[o]) o += 2;           a[i] = o;           id[o] = ++sz;           odd++;         } else if (even < n / 2) {           if (e == 0) e = 2;           while (id[e]) e += 2;           a[i] = e;           id[e] = ++sz;           even++;         }       }     if (o > m || e > m)       printf( -1 n );     else {       printf( %d n , ans);       for (int i = 1; i <= n; i++) {         printf( %d  , a[i]);       }       puts(  );     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int op, d;   int main() {     int nc = 0, bst = 0;     ;     for (cin >> op >> d; d--;) {       string s;       cin >> s;       int c = 0;       for (int i = 0; i < s.size(); ++i)         if (s[i] ==  1 ) ++c;       if (c == op)         nc = 0;       else         ++nc;       bst = max(nc, bst);     }     cout << bst;   }
#include <bits/stdc++.h>   using namespace std;   int n, num, _ = 0;   int a[1005];   int main() {     cin >> n;     map<int, int> mp;     for (int i = 0; i < 100000; i++) _++;     int m = 0;     for (int i = 0; i < 100000; i++) _++;     for (int i = 0; i < n; i++) {       int num;       cin >> num;       if (mp[num] == 0) {         mp[num]++;         a[m++] = num;       }     }     for (int i = 0; i < 100000; i++) _++;     sort(a, a + m);     for (int i = 0; i < 100000; i++) _++;     if (m == 1)       cout << 0 << endl;     else if (m == 2) {       if ((a[1] - a[0]) % 2 == 1)         cout << a[1] - a[0] << endl;       else         cout << (a[1] - a[0]) / 2 << endl;     } else if (m == 3) {       if (a[2] - a[1] == a[1] - a[0])         cout << a[1] - a[0] << endl;       else         cout <<  -1  << endl;     } else       cout <<  -1  << endl;     for (int i = 0; i < 100000; i++) _++;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const double pi = acos(-1.0);   const double eps = 1e-8;   const int mxn = 100033;   const int mod = 1e9 + 7;   inline int read() {     int x = 0, f = 1;     char c = getchar();     while (!isdigit(c)) f = c ==  -  ? -1 : 1, c = getchar();     while (isdigit(c)) x = x * 10 + c -  0 , c = getchar();     return x * f;   }   inline long long gcd(long long a, long long b) {     return b == 0 ? a : gcd(b, a % b);   }   long long ksm(long long a, long long b, long long mod) {     long long ans = 1;     while (b) {       if (b & 1) ans = (ans * a) % mod;       a = (a * a) % mod;       b >>= 1;     }     return ans;   }   long long inv2(long long a, long long mod) { return ksm(a, mod - 2, mod); }   void exgcd(long long a, long long b, long long &x, long long &y, long long &d) {     if (!b) {       d = a;       x = 1;       y = 0;     } else {       exgcd(b, a % b, y, x, d);       y -= x * (a / b);     }   }   int dx[] = {0, 1, 0, -1};   int dy[] = {1, 0, -1, 0};   int n, a[1010];   map<int, int> ct;   int main() {     std::ios::sync_with_stdio(false);     std::cin.tie(0);     std::cout.tie(0);     ;     int t;     cin >> t;     while (t--) {       cin >> n;       int flg = 0;       ct.clear();       for (int i = 1; i <= n; ++i) {         cin >> a[i];         ct[a[i]]++;         if (ct[a[i]] >= 2) flg = 1;       }       if (flg)         cout <<  YES  << endl;       else         cout <<  NO  << endl;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int N = int(2e5) + 99;   const int INF = int(1e9) + 100;   int t;   int n;   long long s;   pair<int, int> p[N];   bool ok(int mid) {     long long sum = 0;     int cnt = 0;     vector<int> v;     for (int i = 0; i < n; ++i) {       if (p[i].second < mid)         sum += p[i].first;       else if (p[i].first >= mid) {         sum += p[i].first;         ++cnt;       } else         v.push_back(p[i].first);     }     assert(is_sorted(v.begin(), v.end()));     int need = max(0, (n + 1) / 2 - cnt);     if (need > v.size()) return false;     for (int i = 0; i < v.size(); ++i) {       if (i < v.size() - need)         sum += v[i];       else         sum += mid;     }     return sum <= s;   }   int main() {     scanf( %d , &t);     for (int tc = 0; tc < t; ++tc) {       scanf( %d %lld , &n, &s);       for (int i = 0; i < n; ++i) scanf( %d %d , &p[i].first, &p[i].second);       sort(p, p + n);       int lf = 1, rg = INF;       while (rg - lf > 1) {         int mid = (lf + rg) / 2;         if (ok(mid))           lf = mid;         else           rg = mid;       }       printf( %d n , lf);     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   using ll = long long int;   void fast() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);   }   int main() {     fast();     int t, b, p, f, h, c;     cin >> t;     while (t--) {       cin >> b >> p >> f;       cin >> h >> c;       int bun = b / 2;       if (bun >= p + f) {         cout << p * h + f * c << endl;       } else {         if (c > h) {           if (bun >= f) {             cout << f * c + (bun - f) * h << endl;           } else {             cout << bun * c << endl;           }         } else {           if (bun >= p) {             cout << p * h + (bun - p) * c << endl;           } else {             cout << bun * h << endl;           }         }       }     }     return 0;   }
#include <bits/stdc++.h>   #pragma comment(linker,  /STACK:100000000 )   using namespace std;   int ri() {     int x;     scanf( %d , &x);     return x;   }   int cnt[1000100];   int main() {     int n, m;     scanf( %d %d , &n, &m);     long long ans = (long long)n * (long long)(n - 1) * (long long)(n - 2) / 6LL;     for (int i = 0; i < m; i++) {       int a, b;       scanf( %d %d , &a, &b);       cnt[a]++;       cnt[b]++;     }     long long sub = 0;     for (int i = 1; i <= n; i++) {       if (cnt[i] != 0) {         sub += (long long)cnt[i] * (n - 1 - (long long)cnt[i]);       }     }     ans -= sub / 2LL;     printf( %lld n , ans);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   long long solve() {     long long n, T, a, b;     cin >> n >> T >> a >> b;     vector<long long> hard(n);     long long x;     long long hardcount = 0, easycount = 0;     for (int i = 0; i < n; ++i) {       cin >> x;       if (x) {         hard[i] = b;         ++hardcount;       } else {         hard[i] = a;         ++easycount;       }     }     vector<long long> mand(n);     for (int i = 0; i < n; ++i) {       cin >> mand[i];     }     vector<pair<long long, long long>> prob(n);     for (int i = 0; i < n; ++i) {       prob[i] = make_pair(mand[i], hard[i]);     }     sort(prob.begin(), prob.end());     int m_easy = 0, m_hard = 0;     long long res = 0;     long long musttime = 0;     for (int i = 0; i < n; ++i) {       long long time = prob[i].first - musttime;       if (time > 0) {         long long solved = m_easy + m_hard;         --time;         solved += min(time / a, easycount - m_easy);         time -= min(time / a, easycount - m_easy) * a;         solved += min(time / b, hardcount - m_hard);         time -= min(time / b, hardcount - m_hard) * b;         res = max(res, solved);       }       if (prob[i].second == b) {         ++m_hard;         musttime += b;       } else {         ++m_easy;         musttime += a;       }     }     long long time = T - musttime;     if (time >= 0) res = n;     return res;   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.precision(30);     cout << fixed;     int t;     cin >> t;     while (t--) {       cout << solve() << endl;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   template <class T>   void read(T& x) {     cin >> x;   }   template <class H, class T>   void read(pair<H, T>& x) {     read(x.first);     read(x.second);   }   template <class A>   void read(vector<A>& v) {     for (auto& x : v) read(x);   }   template <class H, class... T>   void read(H& h, T&... t) {     read(h);     read(t...);   }   string to_string(const char* c) { return (string)c; }   string to_string(char c) { return (string)    + c; }   string to_string(string second) { return second; }   string to_string(bool b) { return b ?  True  :  False ; }   template <class A>   string to_string(vector<A> v) {     string second;     for (auto& x : v) second += to_string(x) +    ;     return second;   }   template <class H, class... T>   string to_string(H& h, T&... t) {     string second;     second += to_string(h);     second +=    ;     second += to_string(t...);     return second;   }   void print(string second) { cout << second <<   n ; }   template <class... A>   void print(A... a) {     print(to_string(a...));   }   int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }   string tb(int x) {     string ans;     int c = x;     for (int i = log2(x); i >= 0; --i) {       if (pow(2, i) <= c) {         ans +=  1 ;         c -= pow(2, i);       } else {         ans +=  0 ;       }     }     return ans;   }   bool ispr(int x) {     if (x <= 1) {       return false;     }     for (int i = 2; i <= sqrt(x); ++i) {       if (x % i == 0) {         return false;       }     }     return true;   }   struct point {     int x;     int y;   };   const int MOD = 1e9 + 7;   const int MX = 2e5 + 5;   const long long INF = 1e18;   void solve() {     double n, k;     cin >> n >> k;     double dist = 0;     point prev;     read(prev.x, prev.y);     for (int i = 1; i < n; ++i) {       point now;       read(now.x, now.y);       dist += sqrt((now.x - prev.x) * (now.x - prev.x) +                    (now.y - prev.y) * (now.y - prev.y));       prev = now;     }     printf( %.9f , (dist * k) / 50);   }   int main() {     std::ios::sync_with_stdio(0);     std::cin.tie(0);     bool isT = 0;     if (isT) {       int t;       cin >> t;       while (t--) {         solve();       }       return 0;     }     solve();     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int A[100010];   int gcd(int a, int b) {     if (b == 0) return a;     return gcd(b, a % b);   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     int t = 1, n, i, j;     cin >> n;     int cnt = 0;     for (i = 0; i < n; i++) {       cin >> A[i];       if (A[i] == 1) cnt++;     }     if (cnt) {       cout << n - cnt <<   n ;     } else {       int cur = 0;       for (i = 0; i < n; i++) cur = gcd(cur, A[i]);       if (cur != 1) {         cout <<  -1 n ;       } else {         int mn = n;         for (i = 0; i < n; i++) {           cur = A[i];           for (int j = i + 1; j < n; j++) {             cur = gcd(cur, A[j]);             if (cur == 1) {               mn = min(mn, j - i);               break;             }           }         }         cout << mn + n - 1 <<   n ;       }     }     return 0;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int n, lft, curr = 1;     scanf( %d , &n);     lft = n;     while (lft) {       if (lft == 3) break;       for (int j = 1; j <= (lft + 1) / 2; j++) {         printf( %d  , curr);       }       curr *= 2;       lft -= (lft + 1) / 2;     }     if (lft == 3) {       printf( %d %d %d n , curr, curr, curr * 3);     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int l[105], r[105];   int dp[105][100005];   int temp[100005];   int q[100005][2], cntl, cntr;   int main() {     int n, k;     scanf( %d%d , &n, &k);     for (int i = 1; i <= k; i++) scanf( %d%d , &l[i], &r[i]);     k++;     l[k] = r[k] = 2 * n;     for (int i = 1; i <= 100005; i++) dp[0][i] = 1005;     dp[0][0] = 0;     for (int i = 1; i <= k; i++) {       for (int j = 0; j <= n; j++) {         dp[i][j] = 1005;         if (j >= l[i] - r[i - 1])           dp[i][j] = min(dp[i][j], dp[i - 1][j - (l[i] - r[i - 1])]);         if (r[i - 1] >= j) dp[i][j] = min(dp[i][j], dp[i - 1][r[i - 1] - j] + 1);       }       if (r[i] != l[i]) {         for (int j = 0; j <= n; j++) {           temp[j] = 1005;           if (j >= r[i] - l[i]) temp[j] = min(temp[j], dp[i][j - (r[i] - l[i])]);           if (l[i] >= j) temp[j] = min(temp[j], dp[i][l[i] - j] + 1);         }         cntl = 0;         cntr = 0;         for (int j = 0; j <= n; j++) {           if (j <= l[i]) {             while (cntl != cntr && q[cntr][1] >= dp[i][l[i] - j] + 1) cntr--;             cntr++;             q[cntr][0] = j;             q[cntr][1] = dp[i][l[i] - j] + 1;           }           if (cntl != cntr && q[cntl + 1][0] + r[i] - l[i] == j) cntl++;           if (cntl != cntr) temp[j] = min(q[cntl + 1][1], temp[j]);         }         for (int j = 0; j <= n; j++) dp[i][j] = temp[j];       }     }     if (dp[k][n] > 3 * k)       printf( Hungry n );     else       printf( Full n%d n , dp[k][n]);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     int n, k, idx = 0;     cin >> n >> k;     pair<int, int> inst[n];     vector<int> v;     for (int i = 1; i <= n; i++) {       int t;       cin >> t;       inst[i - 1] = make_pair(t, i);     }     sort(inst, inst + n);     while (k >= inst[idx].first && idx < n) {       v.push_back(inst[idx].second);       k -= inst[idx].first;       idx++;     }     cout << v.size() << endl;     for (int i = 0; i < v.size(); i++) cout << v[i] <<    ;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     ios::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long i, j, n, a[100001], b[100001], c[100001], d[100001];     cin >> n;     for (i = 0; i < n; i++) {       cin >> a[i];       b[i] = c[i] = a[i];     }     for (i = 0; i < n - 1; i++) {       if (b[i] >= b[i + 1]) b[i + 1] = b[i] + 1;     }     for (i = n - 1; i > 0; i--) {       if (c[i] >= c[i - 1]) c[i - 1] = c[i] + 1;     }     for (i = 0; i < n; i++) {       if (b[i] >= c[i]) {         j = i;         break;       }     }     for (i = 0; i <= j; i++) d[i] = b[i];     for (i = j + 1; i < n; i++) d[i] = c[i];     long long sum = 0;     for (i = 0; i < n; i++) {       sum += (d[i] - a[i]);     }     cout << sum << endl;     return 0;   }
#include <bits/stdc++.h>   using namespace std;   const int dx[] = {-1, 0, 0, 1};   const int dy[] = {0, -1, 1, 0};   int cnt[2][10];   int main() {     int a, b;     cin >> a >> b;     while (a % 2 == 0 || a % 3 == 0 || a % 5 == 0) {       if (a % 2 == 0) {         a /= 2;         cnt[0][2]++;       }       if (a % 3 == 0) {         a /= 3;         cnt[0][3]++;       }       if (a % 5 == 0) {         a /= 5;         cnt[0][5]++;       }     }     while (b % 2 == 0 || b % 3 == 0 || b % 5 == 0) {       if (b % 2 == 0) {         b /= 2;         cnt[1][2]++;       }       if (b % 3 == 0) {         b /= 3;         cnt[1][3]++;       }       if (b % 5 == 0) {         b /= 5;         cnt[1][5]++;       }     }     if (a != b)       puts( -1 );     else {       cout << abs(cnt[0][2] - cnt[1][2]) + abs(cnt[0][3] - cnt[1][3]) +                   abs(cnt[0][5] - cnt[1][5])            << endl;     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   typedef long long ll;   ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }   ll my_exp(ll a, ll b) {     if (b == 0) {       return 1;     } else {       ll temp = my_exp(a, b / 2);       temp *= temp;       if (b % 2 == 1) {         temp *= a;       }       return temp;     }   }   class mycomparison {     bool reverse;       public:     mycomparison(const bool& revparam = false) { reverse = revparam; }     bool operator()(const ll& lhs, const ll& rhs) const {       if (reverse)         return (lhs > rhs);       else         return (lhs < rhs);     }   };   int main() {     std::priority_queue<ll, std::vector<ll>, greater<ll> > fourth;     ll n, m;     vector<ll> insert, getMin, removeMin;     vector<pair<ll, ll> > order;     std::cin >> n;     string a;     for (ll i = 0; i < n; ++i) {       std::cin >> a;       if (a !=  removeMin ) scanf(  %lld n , &m);       if (a ==  insert ) {         order.push_back(make_pair(0, m));         fourth.push(m);       }       if (a ==  removeMin ) {         if (fourth.empty()) {           order.push_back(make_pair(0, 1));           fourth.push(1);         }         order.push_back(make_pair(1, 1));         fourth.pop();       }       if (a ==  getMin ) {         if (fourth.empty()) {           order.push_back(make_pair(0, m));           fourth.push(m);         }         while (fourth.top() < m) {           fourth.pop();           order.push_back(make_pair(1, m));           if (fourth.empty()) {             order.push_back(make_pair(0, m));             fourth.push(m);           }         }         if (fourth.top() == m) {           order.push_back(make_pair(3, m));         } else {           fourth.push(m);           order.push_back(make_pair(0, m));           order.push_back(make_pair(3, m));         }       }     }     std::cout << (ll)order.size() << std::endl;     for (typeof(order.begin()) it = order.begin(); it != order.end(); it++) {       if ((*it).first == 0) {         std::cout <<  insert   << (*it).second << std::endl;       }       if ((*it).first == 1) {         std::cout <<  removeMin  << std::endl;       }       if ((*it).first == 3) {         std::cout <<  getMin   << (*it).second << std::endl;       }     }     return 0;   }
#include <bits/stdc++.h>   using namespace std;   int d[] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};   int a, b, res;   int main() {     scanf( %d%d , &a, &b);     for (int i = a; i <= b; i++) {       int t = i;       while (t) {         res += d[t % 10];         t /= 10;       }     }     printf( %d n , res);     return 0;   }
#include <bits/stdc++.h>   using namespace std;   void read() {     freopen( in.txt ,  r , stdin);     freopen( out.txt ,  w , stdout);   }   bool voi(char c) {     return (c ==  a  || c ==  e  || c ==  i  || c ==  y  || c ==  o  || c ==  u );   }   long long log_pow(long long b, long long p) {     if (p == 0) return 1;     if (p == 1) return b;     if (p % 2) return b * log_pow(b, p - 1);     long long r = log_pow(b, p / 2);     return r * r;   }   int d5l_i() {     int x;     scanf( %d , &x);     return x;   }   long long d5l_l() {     long long x;     scanf( %lld , &x);     return x;   }   char d5l_c() {     char x;     scanf( %c , &x);     return x;   }   long long fact(int n) {     long long fc = 1;     for (int i = 2; i <= n; i++) fc *= i;     return fc;   }   int len(long long n) {     int c = 0;     while (n) {       n /= 2;       c++;     }     return c;   }   bool why(int a, int b, int c) {     return ((long long)a + b > c && (long long)c + b > a && (long long)c + a > b);   }   int a[100005];   long long ans;   int main() {     int n = d5l_i(), m = d5l_i();     for (int i = 0; i < n; i++) a[i] = d5l_i();     sort(a, a + n);     vector<int> v;     bool flag = false, ops = false;     for (int i = 1; i < a[0]; i++) {       if (ans + i > m) {         ops = true;         break;       }       ans += i;       v.push_back(i);     }     if (!ops)       for (int i = 0; i < n - 1; i++) {         for (int j = a[i] + 1; j < a[i + 1]; j++) {           if (ans + j > m) {             flag = true;             break;           }           ans += j;           v.push_back(j);         }         if (flag) break;       }     if (!flag && !ops)       for (int i = a[n - 1] + 1; i <= 1e9; i++) {         if (ans + i > m) break;         ans += i;         v.push_back(i);       }     printf( %d n , v.size());     for (int i = 0; i < v.size(); i++) printf( %d  , v[i]);   }
#include <bits/stdc++.h>   const long long N = 50050;   const long long Q = 2e18;   const long long mod = 1e9 + 7;   const long long MAGIC = 30;   using namespace std;   int a, b, c, n;   void solve() {     cin >> a >> b >> c >> n;     if (a + b - c >= n || c > a || c > b) {       cout << -1 <<   n ;     } else {       cout << n - (a + b - c) <<   n ;     }   }   bool mtest = false;   int main() {     ios_base::sync_with_stdio(0);     int TE = 1;     if (mtest) cin >> TE;     while (TE--) solve();     return 0;   }
#include <bits/stdc++.h>   using namespace std;   vector<long long int> vec;   map<long long int, long long int> mp;   int main() {     long long int x = 0, y = 0, z = 0, sum = 0;     cin >> x;     for (int i = 0; i < x; i++) {       cin >> y;       vec.push_back(y);       mp[y]++;     }     sort(vec.begin(), vec.end());     for (int i = 0; i < vec.size(); i++) {       for (int j = 0; j <= 30; j++) {         z = powl(2, j) - vec[i];         if (binary_search(vec.begin() + i + 1, vec.end(), z) == true) {           if (z == vec[i]) {             sum += --mp[z];           } else {             sum += mp[z];           }         }       }     }     cout << sum << endl;   }
#include <bits/stdc++.h>   using namespace std;   int main() {     printf(          YES nNO nNO nYES nNO nNO nNO nNO nNO nYES nYES nYES nYES nYES nYES nYES            nNO nYES nNO nYES nYES nNO nYES nNO nNO nYES nNO nNO nYES nYES nNO nYES            nNO nYES nNO nYES nYES nYES nNO nYES nYES nNO nYES nYES nNO nYES nYES n           YES nNO nYES nNO nNO nYES nYES nYES nYES nYES nYES nNO nNO nYES nNO nNO            nNO nNO nNO nNO nNO nNO nNO nYES nNO nYES nNO nNO nNO nYES nYES nNO nYE           S nYES nNO nNO nNO nNO nNO nNO nYES nYES nNO nYES nNO nYES nYES nNO nNO            nNO nYES nYES nYES nYES nYES nNO nNO nNO nYES nNO nYES nNO nYES nNO nYE           S nNO nNO nYES nYES nYES nYES nNO nNO nNO nYES nNO nYES nYES nYES nNO nY           ES nNO nNO nNO nYES nNO nNO nNO nYES nYES nYES nYES nYES nYES nYES nYES            nYES nYES nYES nNO nYES nNO nNO nNO nNO nNO nYES nNO nNO nYES nNO nYES            nNO nYES nNO nYES nNO nYES nYES nYES nNO nNO nYES nNO nNO nNO nNO nYES            nNO nYES nNO nNO nYES nNO nYES nYES nYES nNO nNO nNO nYES nYES nNO nYES            nNO nYES nYES nYES nNO nYES nYES nNO nYES nNO nYES nYES nNO nYES nYES n           NO nNO nYES nNO nNO nNO nYES nYES nNO nYES n );     return 0;   }