Cod sursa(job #1711953)
Utilizator | Data | 1 iunie 2016 17:45:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,i,cont,j,v[2000000];
int main()
{
f >> N;
for(i=2;i*i<=N;i++)
{
if(!v[i])
{
for(j=2;j*i<=N;j++)
v[j*i]=1;
}
}
for(i=2;i<=N;i++)
if(!v[i])
++cont;
f.close();
g<<cont;
g.close();
return 0;
}