Cod sursa(job #3169900)
Utilizator | Data | 16 noiembrie 2023 11:31:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int N,q;
in>>N;
v[0]=1;
v[1]=1;
for(int i=2;i<=N;i++){
if(v[i]==0){
for(int j=i*2;j<=N;j+=i){
v[j]=1;
}
}
}
for(int y=0;y<=N;y++){
if(v[y]!=1){
q++;
}
}
out<<q;
return 0;
}