Cod sursa(job #1031213)
Utilizator | Data | 15 noiembrie 2013 17:36:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000005],i,j,n,m=0;
int main()
{
f>>n;
for(i=2;i<=n;++i)
{
if(v[i]==0)
{
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
}
for(i=2;i<=n;++i)
{
if(v[i]==0)
m++;
}
g<<m;
return 0;
}