Cod sursa(job #3284938)
Utilizator | Data | 12 martie 2025 13:05:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,x,y,i,r,j,cnt;
bool Ciur[2000001];
int main()
{
fin>>n;
Ciur[1]=1;
for(i=2; i<=n; i++)
{
if(Ciur[i]==0)
{
for(j=2; i*j<=n; j++)
{
Ciur[j*i]=1;
}
}
}
for(i=1; i<=n; i++)
{
if(Ciur[i]==0)
{
cnt++;
}
}
fout<<cnt;
return 0;
}