Cod sursa(job #1979694)
Utilizator | Data | 11 mai 2017 09:17:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#define NMAX 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[NMAX+5];
int n,cnt;
int main()
{
fin>>n;
for(int i=2;i<=n;i++)
{
if(v[i]==0)
{
cnt++;
for(int j=i+i;j<=n;j+=i)
v[j]=1;
}
}
fout<<cnt<<"\n";
return 0;
}