Cod sursa(job #2266212)
Utilizator | Data | 22 octombrie 2018 14:51:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nrp;
char ciur[2000010];
int main()
{ f>>n;
for(int i=2;i<=n;++i)
if(!ciur[i])
{ nrp++;
for(int j=i+i;j<=n;j+=i) ciur[j]=1;
}
g<<nrp;
g.close();
return 0;
}