Cod sursa(job #1930212)
Utilizator | Data | 18 martie 2017 16:46:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int n,i,j,cnt=0;
in>>n;
v[1]=1;
for(i=1;i<=n;i++)
{
if(v[i]==0)
{
for(j=i*2;j<=n;j=j+i)
v[j]=1;
}
}
for(i=1;i<=n;i++)
{
if(v[i]==0)
cnt++;
}
out<<cnt;
return 0;
}