Cod sursa(job #2280090)
Utilizator | Data | 10 noiembrie 2018 11:22:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
#define N 2000001
int v[N];
int main()
{
int n,i,j,cont=0;
f>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
for(j=i*i;j<=n;j=j+i)
v[j]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
cont++;
g<<cont;
return 0;
}