Primal sport

Posted 行远山

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Primal sport相关的知识,希望对你有一定的参考价值。

time limit per test
1.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob begin their day with a quick game. They first choose a starting number X0?≥?3 and try to reach one million by the process described below.

Alice goes first and then they take alternating turns. In the i-th turn, the player whose turn it is selects a prime number smaller than the current number, and announces the smallest multiple of this prime number that is not smaller than the current number.

Formally, he or she selects a prime p?<?Xi?-?1 and then finds the minimum Xi?≥?Xi?-?1 such that p divides Xi. Note that if the selected prime palready divides Xi?-?1, then the number does not change.

Eve has witnessed the state of the game after two turns. Given X2, help her determine what is the smallest possible starting number X0. Note that the players don‘t necessarily play optimally. You should consider all possible game evolutions.

Input

The input contains a single integer X2 (4?≤?X2?≤?106). It is guaranteed that the integer X2 is composite, that is, is not prime.

Output

Output a single integer — the minimum possible X0.

Examples
input
Copy
14
output
Copy
6
input
Copy
20
output
Copy
15
input
Copy
8192
output
Copy
8191
Note

In the first test, the smallest possible starting number is X0?=?6. One possible course of the game is as follows:

  • Alice picks prime 5 and announces X1?=?10
  • Bob picks prime 7 and announces X2?=?14.

In the second case, let X0?=?15.

 

  • Alice picks prime 2 and announces X1?=?16
  • Bob picks prime 5 and announces X2?=?20.

 

每次找到xi最大的质数因数,然后从xi-pi+1枚举,维护最小值。其中用到了埃式筛法变形。

#include <iostream>
#include <bits/stdc++.h>
#define maxn 1000005
using namespace std;

int n;
int prime[maxn];
void getprime()
{
    int n = 2;
    while (n < maxn)
    {
        int num = n * 2;
        while (num < maxn)
        {
            prime[num] = n;
            num += n;
        }
        num = n + 1;
        while (prime[num] != 0 && num < maxn)
        {
            num++;
        }
        n = num;
    }
}
int main()
{
    getprime();
    int x2,p2,x1,p1,x0;
    int i,j;
    cin>>x2;
     p2=prime[x2];
    int minum=1e9;
    for(i=x2-p2+1;i<=x2;i++)
    {
         p1=prime[i];
         minum=min(minum,i-p1+1);
    }
    cout<<minum<<endl;
    return 0;
}

  

以上是关于Primal sport的主要内容,如果未能解决你的问题,请参考以下文章

primal and dual linear problem

Libliner 中的-s 参数选择:primal 和dual

读文献primal dual PBD

使用Python实现Primal-Dual Interior Point Method

使用Python实现Primal-Dual Interior Point Method

结对项目 sport club