Cod sursa(job #3304765)
| Utilizator | Data | 26 iulie 2025 23:19:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#define NMAX 2000009
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,ans;
char ciur[NMAX];
int main()
{
fin>>N;
ans=0;
ciur[0]=ciur[1]=1;
for(int i=2; i<=N; i++)
{
if(!ciur[i])
{
ans++;
for(int j=2; j<=N/i; j++)
{
ciur[i*j]=1;
}
}
}
fout<< ans << "\n";
return 0;
}
