Pagini recente » Cod sursa (job #597167) | Cod sursa (job #489338) | Cod sursa (job #2482605) | Cod sursa (job #586147) | Cod sursa (job #792572)
Cod sursa(job #792572)
//
// main.cpp
// a1
//
// Created by abc on 9/20/12.
// Copyright (c) 2012 abc. All rights reserved.
//
# include <iostream>
# include <cstdio>
# include <cstdlib>
# include <iomanip>
# include <cmath>
# include <map>
# include <vector>
# include <set>
# include <algorithm>
using namespace std;
# define ISALPHA(Q) (('a' <= Q && Q <= 'z') || ('A' <= Q && Q <= 'Z'))
# define ISDIGIT(a) ('0' <= a && a <= '9')
# define TODIGIT(a) (a - '0')
# define LIKELY(a) (__builtin_expect((a), 1))
# define UNLIKELY(a) (__builtin_expect(!!(a), 0))
typedef unsigned char U8;
typedef long long LONG;
void init()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
}
template <typename T> void read(vector<T> &vec)
{
for(size_t i=0; i<vec.size(); ++i) {
cin >> vec[i];
}
}
struct P2d
{
double x, y;
};
int main(int argc, const char * argv[])
{
init();
int N; cin >> N;
if (N == 2) printf("1 1\n1\n1");
else {
cout << N << " " << 2 << endl;
for(int i=1; i<=N; ++i)
cout << i << " " << i%N+1 << endl;
}
return 0;
}