Cod sursa(job #2496428)
Utilizator | Data | 20 noiembrie 2019 20:51:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,c=0,v[2000001];
in >>n;
for (int i=1;i<=n;i++)
v[i]=1;
for (int i=2;i<=n;i++)
if (v[i]==1)
for (int j=2;j*i<=n;j++)
v[i*j]=0;
for (int i=1;i<=n;i++){
if (v[i]==1){c-=-1;}
}
out <<c-1;
}