Cod sursa(job #1221732)
Utilizator | Data | 21 august 2014 13:09:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int n,sol;
bool ciur[2000005];
int main()
{
ifstream in ("ciur.in");
ofstream out ("ciur.out");
in>>n;
for (int i=2;i<=n;++i)
{
if (ciur[i]==0)
{
++sol;
int j=0;
if (1LL*i*i<=n)
{
j=i*i;
while (j<=n) { ciur[j]=1; j+=i; }
}
}
}
out<<sol;
in.close();
out.close();
return 0;
}