Codeforces Round #306 (Div. 2) D. Regular Bridge 构造

D. Regular Bridge

Time Limit: 20 Sec

Memory Limit: 256 MB

题目连接

http://codeforces.com/contest/550/problem/D

Description

An undirected graph is called k-regular, if the degrees of all its vertices are equal k. An edge of a connected graph is called a bridge, if after removing it the graph is being split into two connected components.

Build a connected undirected k-regular graph containing at least one bridge, or else state that such graph doesn't exist.

Input

The single line of the input contains integer k (1 ≤ k ≤ 100) — the required degree of the vertices of the regular graph.

Output

Print "NO" (without quotes), if such graph doesn't exist.

Otherwise, print "YES" in the first line and the description of any suitable graph in the next lines.

The description of the made graph must start with numbers n and m — the number of vertices and edges respectively.

Each of the next m lines must contain two integers, a and b (1 ≤ a, b ≤ n, a ≠ b), that mean that there is an edge connecting the vertices a and b. A graph shouldn't contain multiple edges and edges that lead from a vertex to itself. A graph must be connected, the degrees of all vertices of the graph must be equal k. At least one edge of the graph must be a bridge. You can print the edges of the graph in any order. You can print the ends of each edge in any order.

The constructed graph must contain at most 106 vertices and 106 edges (it is guaranteed that if at least one graph that meets the requirements exists, then there also exists the graph with at most 106 vertices and at most 106 edges).

Sample Input

1

Sample Output

YES
2 1
1 2

HINT

题意

让你构造度数为k的正则图，然后要求里面至少有一条边是桥

题解：

构造，乱搞……

构造出一个bra图……

代码：

//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define test freopen("test.txt","r",stdin)
#define maxn 2000001
#define mod 10007
#define eps 1e-9
int Num;
char CH[];
const int inf=0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3fLL;
inline ll read()
{
    ll x=,f=;char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x*f;
}
inline void P(int x)
{
    Num=;if(!x){putchar('');puts("");return;}
    while(x>)CH[++Num]=x%,x/=;
    while(Num)putchar(CH[Num--]+);
    puts("");
}
//**************************************************************************************

int main()
{
    int K;
    cin >>K;
    if(K%==)
    {
        cout << "NO";
        return ;
    }
    cout << "YES\n";
    printf("%d %d\n", K*-, (K*-)*K/);
    printf("%d %d\n", , (K*-)+);
    for(int i = ; i <= K; ++i)
    {
        printf("%d %d\n", , i);
        printf("%d %d\n", (K*-)+, (K*-)+i);
        for(int j = K+; j <= *K-; ++j)
        {
            printf("%d %d\n", i, j);
            printf("%d %d\n", (K*-)+i, (K*-)+j);
        }
    }
    for(int i = K+; i <= *K-; i += )
    {
        printf("%d %d\n", i, i+);
        printf("%d %d\n", (K*-)+i, (K*-)+i+);
    }
}