Cod sursa(job #2233388)
| Utilizator | Data | 23 august 2018 10:04:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#define MAX 200000
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int v[MAX],N;
int Prim(int nr)
{
int k=0,i;
for(i=1;i<=nr/2;i++)
if(nr%i==0)
k++;
if(k==1)
return 1;
else
return 0;
}
void Vector(int N)
{
int i,k,ok=0;
for(i=2;i<=7;i++)
if(Prim(i)==1)
{
k=2;
while(i*k<=N)
{
v[i*k]=1;
k++;
}
}
for(i=2;i<=N;i++)
if(v[i]==0)
ok++;
g<<ok;
}
int main()
{f>>N;
Vector(N);
return 0;
}
