Cod sursa(job #2084318)
| Utilizator | Data | 8 decembrie 2017 22:24:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ( "ciur.in");
ofstream fout("ciur.out");
int N,i,j,p,nrp=0;
fin>>N;
short int v[N+1];
v[0]=N;
v[1]=0;
for(i=2;i<=N;i++)
v[i]=1;
for(i=2;i<=N;i++){
if(v[i]==1){
p=i;
for(j=i+p;j<=N;j=j+p)
v[j]=0;
}
}
for(i=1;i<=N;i++)
if(v[i]==1)
nrp++;
fout<<nrp;
fin.close();
fout.close();
return 0;
}
