Cod sursa(job #1066268)
Utilizator | Cretu Bogdan reking | Data | 24 decembrie 2013 13:29:52 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | riad2 | Marime | 0.36 kb |
#include <fstream>
#define max 2000002
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[max];
long long i,j,n,ct;
int main ()
{
f>>n;
for (i=2;i<=n;i++) prim[i]=1;
for (i=2;i<=n;i++)
if (prim[i]==1)
{
ct++;
for (j=i*i;j<=n;j=j+i) prim[j]=0;
}
g<<ct;
}