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