Cod sursa(job #3225865)
Utilizator | Data | 19 aprilie 2024 11:13:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n,p;
bool ciur[2000002];
int main()
{
cin>>n;
ciur[1]=ciur[0]=1;
for(int i=2;i<=n;i++)
if(!ciur[i]){
p++;
for(int j=2*i;j<=n;j+=i)
ciur[j]=1;
}
cout<<p;
return 0;
}