Cod sursa(job #2143287)
Utilizator | Data | 25 februarie 2018 19:38:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i,j,N,nr=0;
int *v = new int[2000000];
f>>N;
for(i=2;i<=N;i++)
{
v[i]=1;
}
for(i=2;i*i<=N;i++)
{
for(j=2*i;j<=N;j+=i)
{
v[j]=0;
}
}
for(i=2;i<=N;i++)
{
if(v[i]==1)
{
nr++;
}
}
g<<nr;
}