Cod sursa(job #1502102)
Utilizator | Data | 14 octombrie 2015 10:29:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int i, j, N, nr = 0;
bool* V = new bool[2000003];
f>>N;
nr = 1;
for(i = 2; i<=N; i++)
{
if(V[i])
{
for(j=i+i;j<=N;j = j+i)
{
V[j] = false;
}
}
}
for(i=3;i<=N;i++)
{
if(V[i]) nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}