Cod sursa(job #2340439)
Utilizator | Data | 10 februarie 2019 14:11:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000002];
int main()
{
long long n;
int nr=0,i,j;
in>>n;
for(i=2; i<=n; i++)
{
for(j=2; j<=n; j++)
v[i*j]=1;
}
for(i=2; i<=n; i++)
if(v[i]==0)
nr++;
out<<nr;
return 0;
}