Cod sursa(job #1538006)
Utilizator | Data | 28 noiembrie 2015 13:20:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int n, contor=0, i, j;
in>>n;
v[1]=1;
for( i=1; i<=n; i++)
for(i=2;i<=n;i++)
if(v[i]==0)
for( j=2; j*i<=n; j++)
v[i*j]=1;
for(i=1;i<=n; i++)
if(v[i] ==0)
contor++;
out<<contor;
return 0;
}