Cod sursa(job #3362990)
| Utilizator | Data | 13 august 2026 12:09:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n;
fin>>n;
int decateori=0;
bool ciur[n+1]={0};
ciur[0]=ciur[1]=1;
for(int i=2;i<=n;i++)
{
if(ciur[i]==0)
{
for(int j=i*2;j<=n;j+=i)
{
ciur[j]=1;
}
decateori+=1;
}
}
fout<<decateori;
return 0;
}
