Cod sursa(job #2247076)
Utilizator | Data | 27 septembrie 2018 21:06:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,nr=0;
bool ciur[2000006];
f>>n;
for(int i=2;i<=n;i++)
ciur[i]=1;
for(int i=2;i<=n;i++)
for(int j=i*2;j<=n;j=j+i)
ciur[j]=0;
for(int j=2;j<=n;j++)
if(ciur[j]==1)
nr++;
g<<nr;
}