Cod sursa(job #2924624)
Utilizator | Data | 6 octombrie 2022 18:31:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
bool v[2000000];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,r=0;
in>>n;
for(int i=2;i<=n;i++)
v[i-1]=1;
for(int i=2;i<=n;i++)
{
if(v[i-1])
{
r++;
for(int j=i+1;j<=n;j++)
{
if(j%i==0)
v[j-1]=0;
}
}
}
out<<r;
}