Mahmoud was trying to solve the vertex cover problem on trees. The problem statement is:
Given an undirected tree consisting of n nodes, find the minimum number of vertices that cover all the edges. Formally, we need to find a set of vertices such that for each edge (u, v) that belongs to the tree, either u is in the set, or v is in the set, or both are in the set. Mahmoud has found the following algorithm:
- Root the tree at node 1.
- Count the number of nodes at an even depth. Let it be evenCnt.
- Count the number of nodes at an odd depth. Let it be oddCnt.
- The answer is the minimum between evenCnt and oddCnt.
The depth of a node in a tree is the number of edges in the shortest path between this node and the root. The depth of the root is 0.
Ehab told Mahmoud that this algorithm is wrong, but he didn't believe because he had tested his algorithm against many trees and it worked, so Ehab asked you to find 2 trees consisting of n nodes. The algorithm should find an incorrect answer for the first tree and a correct answer for the second one.
The only line contains an integer n (2 ≤ n ≤ 105), the number of nodes in the desired trees.
The output should consist of 2 independent sections, each containing a tree. The algorithm should find an incorrect answer for the tree in the first section and a correct answer for the tree in the second. If a tree doesn't exist for some section, output "-1" (without quotes) for that section only.
If the answer for a section exists, it should contain n - 1 lines, each containing 2 space-separated integers u and v (1 ≤ u, v ≤ n), which means that there's an undirected edge between node u and node v. If the given graph isn't a tree or it doesn't follow the format, you'll receive wrong answer verdict.
If there are multiple answers, you can print any of them.
2
-1 1 2
8
1 2 1 3 2 4 2 5 3 6 4 7 4 8 1 2 1 3 2 4 2 5 2 6 3 7 6 8
In the first sample, there is only 1 tree with 2 nodes (node 1 connected to node 2). The algorithm will produce a correct answer in it so we printed - 1 in the first section, but notice that we printed this tree in the second section.
In the second sample:
In the first tree, the algorithm will find an answer with 4 nodes, while there exists an answer with 3 nodes like this:
In the second tree, the algorithm will find an answer with 3 nodes which is correct:
传送门：http://codeforces.com/problemset/problem/959/C
题意：输入一个n，代表一棵n个节点的树。有个同学提出了个猜想，他想通过删除点（删除一个点就是同时删除和它相连的所有边）来删除完所有边，他认为x=min（这棵树的奇深度的所有点的个数，这棵树的偶深度的所有点的个数），这个x就是可以删除所有边的最小的要切除的点的个数。要输出一个反例的树，然后在输出一个符合的树。
思路：符合的树很好想，一棵笔直笔直的树，总是要砍n/2个点的，反例的话在<=5的时候构造不出，>6之后可以先从根分出三个子节点，然后把剩下点连到任意一个子节点上，这样切这个向日葵一样的子节点可以切断很多很多边，然后切掉根节点，就可以把所有边切掉了，最小是2，而此时n>=6，x最小的情况是n/2，肯定大于2。
吐槽：题目看不懂，思路想不到，全靠大佬小姐姐教才会QUQ
代码：
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<iostream>
#include<map>
#include<vector>
#include<set>
#include<queue>
using namespace std;
int n;
int main()
{
cin>>n;
if (n<=5)
{
printf("-1\n");
}
else
{
printf("1 2\n");
printf("1 3\n");
printf("1 4\n");
for(int i=5;i<=n;i++)
printf("3 %d\n",i);
}
for (int i=1;i<n;i++)
{
printf("%d %d\n",1,i+1);
}
return 0;
}