Prime Generator problem Spoj Solution

-

 #include<iostream>

#include<cmath>

using namespace std;

typedef long long l;

bool prime(l );

int main(){

l t;

cin>>t;

while(t--){

l n,m,i;

cin>>m>>n;

for(i=m;i<=n;i++){

  if(prime(i)){

cout<<i<<endl;

}

}

cout<<endl;

}

}

bool prime(l a){

if(a==1)

return 0;

for(l i=2;i*i<=a;i++){

if(a%i==0)

return 0;

}

return 1;

}


Comments

Post a Comment

Popular posts from this blog

Factorials problem spoj Solution

-
In order to find factorial of n and number zeros at the end of factorial decimal, i simply find prime factors (5) ,and find the count then the count is our required answer.  #include <iostream> using namespace std; typedef long long l; int zero(l ); int main() { l t; cin>>t; while(t--){ l n; cin>>n; cout<<zero(n)<<endl; } return 0; } int zero(l n){ l c=0; if(n<0) return 0; for(l i=5;n/i>=1;i=i*5){ c+=n/i; } return c; }
Read more

Adding Reversed Numbers Spoj Solutions

-
 #include <iostream> using namespace std; int main() { int t; cin>>t; while(t--){ long long int n,m,rev=0,rev1=0,n1,m1,s=0,r; cin>>n>>m; n1=n;m1=m; while(n>0){ rev=rev*10+n%10; n/=10; } while(m>0){ rev1=rev1*10+m%10; m/=10; } s=rev+rev1; long long int srev=0;     while(s>0){ srev=srev*10+s%10; s/=10; } cout<<srev<<endl; } return 0; } 😀😀😀😀😀😀 If you have any doubts comment below👇
Read more