Cod sursa(job #1746841)
Utilizator | Data | 24 august 2016 00:08:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int v[500];
int a,i,S,j,k,ok;
f>>a;
S=0;
j=0;
k=0;
ok=1;
if(a>=2)
{
S=1;
j=1;
v[j]=2;
k=1;
}
for(i=3;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;
}
}
g<<S;
return 0;
}