#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+2;
const int mod = 1e9 + 7;
int n;
vector<pair<int, int>>G[20];
vector<int>ans;
void dfs (int nod, int val, int par) {
ans.push_back(val);
for (auto it : G[nod]) {
if (it.first == par) continue;
dfs(it.first, val ^ (1 << it.second), nod);
}
}
int main ()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
G[x].push_back({y, i});
G[y].push_back({x, i});
}
dfs(0, 0, 0);
cout << (1 << (n - 1)) << "\n";
for (int i = 0; i < (1 << n); i++)
if (__builtin_popcount(i) % 2 == 0) {
for (auto it : ans)
cout << (i ^ it) << " ";
cout << "\n";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Edge is not in hipercube |
| 3 |
Halted |
0 ms |
0 KB |
- |
