Cod sursa(job #1855106)
Utilizator | Data | 23 ianuarie 2017 14:00:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim[2000000];
int main()
{
int n,d,i,j,cnt=0;
f>>n;
for(i=2;i<n;++i)
{
if(prim[i]==0)
{
cnt++;
for(j=i+i;j<n;j+=i)
prim[j]=1;
}
}
g<<cnt;
return 0;
}