Cod sursa(job #1814141)
Utilizator | Data | 23 noiembrie 2016 18:06:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,v[2000005],c;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
in>>n;
for (int i=2;i<=n;i++) v[i]=1;
for (int i=2;i<=n;i++)
if(v[i])
{
c++;
for (int j=i+i;j<=n;j+=i)
v[j]=0;
}
out<<c;
return 0;
}