Cod sursa(job #1977545)
Utilizator | Data | 5 mai 2017 14:33:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,v[2000000+3],k;
int main()
{
f>>n;
for(int i=2;i<=n;i++)
{
if(!v[i])
{
k++;
int j=2;
while(i*j<=n)
{
v[i*j]=1;
++j;
}
}
}
g<<k;
return 0;
}