Cod sursa(job #1807996)
Utilizator | Data | 17 noiembrie 2016 10:22:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int v[2000001];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n;
in>>n;
for(int i=2;i*i<=n;i++)
if(v[i]==0)
for(int j=2*i;j<=n;j=j+i)
v[j]=1;
int s=0;
for(int i=2;i<=n;i++)
if(v[i]==1)
s++;
out<<s;
}