Cod sursa(job #1541660)
Utilizator | Data | 4 decembrie 2015 14:42:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int gg;
int main()
{int N,i,j;
in>>N;
for(i=2;i<=N;i++)
{
if(v[i]==0)
{
gg++;
for(j=i*2;j<=N;j=j+i)
v[j]=1;}
}
out<<gg;
return 0;
}