Cod sursa(job #2131758)
Utilizator | Data | 14 februarie 2018 22:15:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,v[2000001],k,i,j;
int main()
{
f>>n;
for(i=2; i<=n; i++)
v[i]=1;
for(i=2; i<=n; i++)
if(v[i]==1)
{
for(j=i*2; j<=n; j=j+i)
v[j]=0;
k++;
}
g<<k;
return 0;
}