Cod sursa(job #2939532)
Utilizator | Data | 13 noiembrie 2022 21:04:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
unsigned long N, v[2000000], i, j, k=0, ok=1;
int main()
{
f>>N;
for(i=1; i<=N-1; i++)
{
v[i-1]=i+1;
}
for(i=0; i<=N-1; i++)
{
if(v[i]!=1){
for(j=i+1; j<=N-1; j++)
{
if(v[j]!=1){
if(v[j]%v[i]==0 && ok==1)
{
k++;
ok=0;
v[j]=1;
}
}
ok=1;
}
}
}
g<<N-k;
return 0;
}