Cod sursa(job #1290870)
Utilizator | Data | 11 decembrie 2014 21:42:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int p[100000];
int main()
{
int N;
int x=0, i, j=1;
int c=0;
fin>>N;
p[1]=2;
for(i=3; i<=N; i++)
{
for(x=1; x<=j; x++)
{
if(i%p[x]==0)
{
c=1;
break;
}
}
if(c==0)
{
p[j+1]=i;
j++;
}
c=0;
}
fout << j;
return 0;
}