Cod sursa(job #955729)

Utilizator radu33Nesiu Radu radu33 Data 1 iunie 2013 13:46:27
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include<iostream>
#include<fstream>
#define NMAX 2000000
#include<stdio.h>
#include<math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,v[NMAX];

int main()
{int i,j,k=0;
	f>>n;
	for(i=2;i<=n;i++)
		v[i]=1;
for(i=2;i<=sqrt(n);i++)
  if(v[i])
  
	for(j=2*i;j<=n;j=j+i)
         if(v[j]==1)v[j]=0; 
               for(i=2;i<=n;i++)
				   if(v[i]==1)k++;
	
	g<<k;


return 0;
}