Cod sursa(job #2080918)
Utilizator | Data | 3 decembrie 2017 17:33:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[1000001];
int n,i,ct,j,a;
int main()
{
for(i=2;i<1000;i++)
if(v[i]==0)
for(j=i*i;j<=1000000;j=j+i)
v[j]=1;
fin>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
ct++;
fout<<ct;
return 0;
}