Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 40121

Help ram @ABACUS .... can anyone check which case i m missing ??

$
0
0

include<stdio.h>

include<math.h>

int checkprime(long long x) { long long j,flag=0; for(j=2;j<=sqrt(x);j++) { if(x%j==0) { flag=-1; break ; } } return flag ; }

long long divisor(long long i) { long long j,m=-1; int a,b; for(j=2;j<=sqrt(i);j++) { if(i%j==0) { a=checkprime(j); b=checkprime(i/j); if((a==0) && (b==0)) { m=i; break ; } } } return m ; }

int main() { long long a,b,t,i,j,k; scanf("%lld", &t); while(t--) { scanf("%lld %lld", &a ,&b); for(i=b;i>=a;i--) { j=divisor(i); if(j!=-1) { printf("%lld\n",j); break ; } } if(j==-1) printf("%lld\n",j); } return 0 ; }


Viewing all articles
Browse latest Browse all 40121

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>