Codeforces B. Relatively Prime Pairs 1051B

A solution in c++

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long int ll;

#define FastIO  ios_base::sync_with_stdio(false); cin.tie(0);
#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)
#define sc3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld\n",a,b,c)

void sieve()
{
    ll n,i,j;
    for(i=4; i<mx; i+=2) checkprime[i] = 1;
    for(i=3; i*i<=mx; i+=2){
        if(checkprime[i]==0){
            for(j=i*i; j<mx; j+=(i+i))
                checkprime[j] = 1;
        }
    }
    for(i=2; i<mx; i++) if(!checkprime[i]) prime.push_back(i);
}

int main()
{
    FastIO;
    //sieve();
    ll n,m,t,c,i,j=0,k,ck=0,dk=0,a,b;

    sc2(n, m);
    cout<<"YES"<<endl;
    for(i=n; i<=m; i+=2){
            cout<<i<<" "<<i+1<<endl;
     }

}