Cod sursa(job #1504966)
Utilizator | Data | 18 octombrie 2015 16:46:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define nmax 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[nmax];
int nr,n;
int main()
{
f>>n;
for(int i=2;i<=n;i++)
{
if(!v[i])
{
for(int j=i+i;j<=n;j=j+i)
{
v[j]=1;
}
nr++;
}
}
g<<nr;
return 0;
}