B. Vile Grasshoppers

newhonor

于 2019-08-23 10:08:05 发布

阅读量167

点赞数

本文链接：https://blog.csdn.net/weixin_39132605/article/details/100031676

版权

https://codeforc.es/problemset/problem/937/B

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e9+3;
const int maxm=1e6+9;
const int mod=998244353;


int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);


    int p,y;
    cin>>p>>y;



    for(int i=y;i>p;i--)
    {
        bool f=1;
        for(int j=2;j<=p&&j*j<=i;j++)
        {
            if(i%j==0)
            {
                f=0;
                break;
            }
        }
        if(f)
        {
            cout<<i<<endl;
            return 0;
        }
    }

    cout<<-1<<endl;

    return 0;
}