Cod sursa(job #2541301)
Utilizator | Data | 8 februarie 2020 12:28:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int v[2000000];
int main()
{
ifstream f("ciur.in");
ofstream c("ciur.out");
int i,j=2,n,nr=0;
f>>n;
for(i=0;i<n-1;i++)
{
v[i]=j;
j++;
}
for(i=0;i<n-1;i++)
if(v[i]!=0)
for(j=i+1;j<n-1;j++)
if(v[j]%v[i]==0)
v[j]=0;
for(i=0;i<n-1;i++)
if(v[i]!=0)
nr++;
c<<nr;
f.close();
c.close();
return 0;
}