Cod sursa(job #1014441)
Utilizator | Data | 22 octombrie 2013 18:35:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
bool v[2000001]={0};
int main()
{long n,nr=0,i,j;
ifstream f("ciur.in");f>>n;
ofstream g("ciur.out");
v[1]=1;
for(i=2;i<=n;i++)
if(v[i])
for(j=2*i;j<=n;j+=i)
v[i]=0;
for(i=2;i<=n;i++)
if(v[i])
nr++;
g<<nr;
}