Cod sursa(job #1552090)
Utilizator | Data | 17 decembrie 2015 11:16:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000010];
int i,j,x,n,a,b,nr;
int main()
{
fin>>n;
nr=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
nr=nr+1;
j=i;
while(j<n)
{j=j+i;
v[j]=1;}
}
}
fout<<nr;
return 0;
}