CF 450E Jzzhu and Apples 数学+模拟

E. Jzzhu and Apples

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Jzzhu has picked n apples from his big apple tree. All the apples are numbered from 1 to n. Now he wants to sell them to an apple store.

Jzzhu will pack his apples into groups and then sell them. Each group must contain two apples, and the greatest common divisor of numbers of the apples in each group must be greater than 1. Of course, each apple can be part of at most one group.

Jzzhu wonders how to get the maximum possible number of groups. Can you help him?

Input

A single integer n (1 ≤ n ≤ 105), the number of the apples.

Output

The first line must contain a single integer m, representing the maximum number of groups he can get. Each of the next m lines must contain two integers — the numbers of apples in the current group.

If there are several optimal answers you can print any of them.

Examples

input

Copy

6

output

Copy

2
6 3
2 4

input

Copy

9

output

Copy

3
9 3
2 4
6 8

input

Copy

2

output

Copy

0

题目要求的是在1-n范围内最多有多少对数的最大公约数大于1
因为要求最大，所以偶数对和奇数对要尽量不凑成对
考虑到加双倍后奇数任然是奇数，所以我们可以通过加倍的方式找出公约数大于1的对数
然后就是细节的处理了

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#define debug(a) cout << #a << " " << a << endl
using namespace std;
typedef long long ll;
const ll mod = 1e9 + ;
const ll maxn = 1e5 + ;
ll vis[maxn], is[maxn];
vector<ll> a;
vector< pair< ll, ll > > E;
int main() {
    std::ios::sync_with_stdio(false);
    ll n;
    while( cin >> n ) {
        memset( vis, , sizeof(vis) );
        memset( is, , sizeof(is) );
        E.clear();
        for( ll i = ; i <= n; i +=  ) {
            vis[i] = ;
        }
        for( ll i = ; i <= n; i +=  ) { //找出奇数的倍数
            if( !vis[i] ) {
                if( i* > n ) {
                    break;
                }
                a.clear();
                for( ll j = i; j <= n; j += *i ) {
                    vis[j] = ;
                    if( !is[j] ) {
                        is[j] = ;
                        a.push_back(j);
                    }
                }
                for( ll j = a.size()-; j > ; j -=  ) {
                    E.push_back( make_pair( a[j], a[j-] ) );
                    is[a[j]] = is[a[j-]] = ;
                }
                if( a.size() &  ) { //如果有单独无法找到配对的奇数，用他的而倍数与之配对
                    E.push_back( make_pair( a[], a[]* ) );
                    is[a[]] = is[a[]*] = ;
                }
            }
        }
        if( n &  ) {
            n --;
        }
        ll flag = , t;
        for( ll i = n; i > ; i -=  ) { //除去奇数后剩余的偶数对
            if( !is[i] ) {
                if( !flag ) {
                    flag = ;
                    t = i;
                } else {
                    flag = ;
                    E.push_back( make_pair( i, t ) );
                }
            }
        }
        cout << E.size() << endl;
        for( ll i = ; i < E.size(); i ++ ) {
            cout << E[i].first << " " << E[i].second << endl;
        }
    }
    return ;
}