Cod sursa(job #2505443)
Utilizator | Data | 6 decembrie 2019 20:59:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
int v[2000005];
int main()
{
fin>>N;
int s=0;
for(int i=2;i<=N;i++)
v[i]=i;
for(int i=2;i<=N;i++)
if(v[i]){
s++;
for(int j=i+i;j<=N;j+=i)
v[j]=0;
}
fout<<s;
return 0;
}