Cod sursa(job #1893314)
Utilizator | Data | 25 februarie 2017 16:50:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#define DM 2000005
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[DM];
int main()
{
int i,n,j,nr=0;
fin>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
nr++;
for(j=i;j<=n/i;j++)
{
v[i*j]=1;
}
}
}
fout<<nr;
return 0;
}