Cod sursa(job #1321861)
Utilizator | Data | 19 ianuarie 2015 16:57:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n;
bool c[2000001];
int main()
{
ifstream in("ciur.in");
in>>n;
int i,j,nr=0;;
for(i=2; i*i<=n; i++)
{
if(!c[i])
{
for(j=i*i; j<=n; j+=i)
{
c[j]=true;
}
}
}
for(i=2;i<=n;i++)
{
if(!c[i])
nr++;
}
in.close();
ofstream out("ciur.out");
out<<nr;
out.close();
return 0;
}