Cod sursa(job #2540964)
Utilizator | Data | 7 februarie 2020 21:26:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
int num[1000000];
int main()
{
ifstream f("ciur.in");
ofstream c("ciur.out");
int N,i,j,ok,nr;
f>>N;
nr=1;
num[0]=2;
for(i=3;i<=N;i++)
{
ok=1;
for(j=0;j<nr;j++)
if(i%num[j]==0)
{
j=nr;
ok=0;
}
if(ok==1)
{
num[nr]=i;
nr++;
}
}
c<<nr;
return 0;
}