Sunday, 5 March 2017

Geeksforgeeks Solution For " Sum of all prime numbers between 1 and N. "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given a positive integer N, calculate the sum of all prime numbers between 1 and N.

Submit Your Solution :- Click Here 


Solution :-

#include <iostream>
#include<math.h>
using namespace std;

int main() 
{
    int A[1000000];
int k=0,i,j,flag,s,t,num;
long sum;
for(i=2;i<1000000;i++)
{
   if(i>2&&i%2==0)
     continue;
   s=sqrt(i);
   flag=0;
   for(j=2;j<=s;j++)
   {
       if(i==j)
          continue;
       if(i%j==0)
       {
           flag=1;
           break;
       }         
   }
   if(flag==0)
   {
       A[k]=i;
       k++;
   }      
}
cin>>t;
while(t--)
{   sum=0;
   cin>>num;
   i=0;
   while(A[i]<=num)
   {
       sum=sum+A[i];
         i++;
   }  
   cout<<sum<<"\n";
      
}
return 0;
}

Output:-
Geeksforgeeks Solution For " Sum of all prime numbers between 1 and N. "


No comments:
Write comments

Recommended Posts × +