| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 931903 | hugsfromadicto | Geppetto (COCI15_geppetto) | C++14 | 2 ms | 604 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mxN = 2000;
int a[mxN], b[mxN];
int s[mxN];
void _()
{
    int n;
    cin >> n;
    int k = (1<<n);
    int b = k;
    int m;
    cin >> m;
    int cnt = 0;
    for(int i = 0; i < m; ++i)
    {
        int x,y;
        cin >> x >> y;
        for(int i = 0; i < k; ++i)
        {
                if(i & (1 << (x - 1)) and i & (1 << (y - 1)))
                {
                    if(!s[i])
                        cnt++;
                    s[i]++;
                }
        }
    }
    cout << k - cnt;
}
main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int tc = 1;
  while(tc--)
  {
      _();
  }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
