Cod sursa(job #3182195)
Utilizator | Data | 8 decembrie 2023 18:36:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char V[2000000];
int main()
{
int N,c=0;
fin>>N;
for(short int d=2;d*d<=N;d++)
{
if(V[d]==0)
{
for(int j=d+d;j<=N;j+=d)
{
V[j]=1;
}
}
}
for(int d=2;d<=N;d++)
{
if(V[d]==0)
{
c++;
}
}
fout<<c;
return 0;
}