Cod sursa(job #1746839)
Utilizator | Data | 24 august 2016 00:05:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
#include <cmath>
int prim(int n)
{
int i;
int k=sqrt(n);
if(n<2)
return 0;
if(n==2)
return 1;
if(n%2==0)
return 0;
for(i=3; i<=k; i+=2)
if(n-n/i*i==0)
return 0;
return 1;
}
int main()
{
int v[500];
int a,i,S=0;
cin>>a;
if(a>=2)
S=1;
for(i=1;i<=a;i+=2)
{
ok=1;
for(j=1;j<=k;j++)
if(i%v[j]==0)
ok=0;
if(ok!=0)
{
j+=1;
v[j]=i;
k+=1;
S+=1;
}
}
cout<<S;
return 0;
}