Cod sursa(job #2197148)
Utilizator | Data | 21 aprilie 2018 11:36:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
fstream f("ciur.in",ios::in);
fstream g("ciur.out",ios::out);
int v[2000000]={0},n,nr=0;
f>>n;
for(int i=2;i<=n;i++)
{
if(v[i]==0)
{for(int j=i*i;j<=n;j=j+i)
v[j]=1;
nr++;
}
}
g<<nr;
}