Cod sursa(job #1620132)
Utilizator | Data | 28 februarie 2016 20:51:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int nmax=2000001;
int v[nmax];
int main()
{
int n,s=0;
in>>n;
in.close();
for(int i=2;i<=n;i++)
if(v[i]==0)
{
s++;
for(int j=i+i;j<=n;j=j+i)
v[j]=1;
}
out<<s;
out.close();
return 0;
}