Uva 914 - Jumping Champion

 /*
Verdict :: Accepted
*/
/// Header file begin
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include<utility>
#include <queue>
#include <algorithm>
/// End
//..........
/// Macro
#define sf scanf
#define pf printf
#define sfint(a,b) scanf("%d %d",&a,&b)
#define sfl(a,b) scanf("%ld %ld",&a,&b)
#define sfll(a,b) scanf("%lld %lld",&a,&b)
#define sfd(a,b) scanf("%lf %lf",&a,&b)
#define sff(a,b) scanf("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define mem(c,v) memset(c,v,sizeof(c))
#define cp(a) cout<<" "<<a<<" "<<endl
#define nl puts("")
#define sq(x) ((x)*(x))
#define all(x) x.begin(),x.end()
#define sz size()
#define gc getchar()
#define pb push_back
/// End.........

/// Size
#define mx7 20000100
#define mx6 1500000
#define mx5 100005
#define mx4 1000100
#define inf 1<<30                                           //infinity value
#define eps 1e-9
#define mx (65540)
#define mod 1000000007
#define pi acos(-1.0)



using namespace std;
//..................................................................................................................
typedef long long LL;
typedef long L;
typedef unsigned long long ull;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;

template<class T> T setbit(T n, T pos){n=n|(1<<pos); return n;}
template<class T> T checkbit(T n, T pos){n=n&(1<<pos); return n;}
template<class T> T gcd(T a, T b ) {return b==0?a:gcd(b,a%b);}
template<class T> T large(T a, T b ) {return a>b?a:b;}
template<class T> T small(T a, T b ) {return a<b?a:b;}
template<class T> T difr (T a, T b) {return a>b?a-b:b-a;}

LL prime[mx4],prm[(mx4/2)+1],plen=1;

void seieve(LL n)
{
    LL i,j,x=(L)sqrt(double(n)) + 1;

    prime[0]=setbit<LL>(prime[0],0);
    prime[0]=setbit<LL>(prime[0],1);

    for(i=4;i<=n;i+=2)
    {
        prime[i>>5]=setbit<LL>(prime[i>>5],i&31);
    }

    for(i=3;i<x;i+=2)
    {
        if(!checkbit<LL>(prime[i>>5],i&31))
        {
            for(j=i*i;j<=n;j+=i)
            {
                prime[j>>5]=setbit<LL>(prime[j>>5],j&31);
            }
        }
    }

//    for(i=2;i<=n;i++)
//    {
//        if(!checkbit<LL>(prime[i>>5],i&31))
//        {
//            prm[plen++]=i;
//        }
//    }

    //for(i=1;i<=plen;i++)cp(prm[i]);
}

struct my
{
    LL indx,cnt;
};

bool cmp(my a, my b)
{
    return a.cnt > b.cnt;
}

my ar[mx4];

int main()
{
    seieve(mx4);
    map<LL,LL>mp;
    vector<LL>v;

    LL t;
    sf("%lld",&t);

    while(t--)
    {
        LL l,u,arlen=0;
        sf("%lld %lld",&l,&u);

        mp.clear();
        v.clear();
        mem(ar,0);

        if(l<=1)
        {
            l=2;
        }

        if(l > u)
        {
            l^=u;
            u^=l;
            l^=u;
        }

        for(LL i=l;i<=u;i++)
        {
            if(!checkbit<LL>(prime[i>>5],i&31))
            {
                v.push_back(i);
            }
        }

        LL vlen=v.size(),diff,ans,maxi=-1;

        for(LL i=0;i<vlen-1;i++)
        {
            pLL d = make_pair(v[i],v[i+1]);
            //cout << "(" << d.first << " " << d.second << ") ";
            diff = difr(d.first,d.second);
            //cout << " diff = " << diff ;
            mp[diff]++;
            //cout << " mp " << mp[diff] << endl;

            ar[arlen].indx=diff;
            ar[arlen++].cnt=mp[diff];
        }

        sort(ar,ar+arlen,cmp);

//        for(LL i=0;i<arlen;i++)
//        {
//            cout << ar[i].indx << " " << ar[i].cnt << endl;
//        }

        if(ar[0].cnt == ar[1].cnt)
        {
            pf("No jumping champion\n");
        }

        else
        {
            pf("The jumping champion is %lld\n",ar[0].indx);
        }
    }

    return 0;
}