Cod sursa(job #665300)
Utilizator | Data | 21 ianuarie 2012 21:58:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream>
using namespace std;
int v[2000000];
int n,cnt,i,j;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;++i)
if(!v[i])
{
//for(j=2;i*j<=n;++j)
v[i*j]=1;
++cnt;
}
fout<<cnt;
}