Cod sursa(job #2298825)
Utilizator | Data | 8 decembrie 2018 15:45:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000001];
int main()
{
int n,i,j,nr=0;
f>>n;
v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=2*i;j<=n;j=j+i)
v[j]=1;
}
}
for(i=1;i<=n;i++)
if(v[i]==0)
nr++;
g<<nr;
return 0;
}