Cod sursa(job #2535398)
Utilizator | Data | 31 ianuarie 2020 20:27:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
int v[1000000];
int main()
{
ifstream f("ciur.in");
ofstream c("ciur.out");
int N,i,prim,j,k;
f>>N;
j=0;
k=1;
v[j]=2;
for(i=3;i<=N;i++)
{
prim=1;
for(j=0;j<k;j++)
if(i%v[j]==0)
{
j=k;
prim=0;
}
if(prim==1)
{
v[k]=i;
k++;
}
}
c<<k;
return 0;
}