Cod sursa(job #1015288)
Utilizator | Data | 24 octombrie 2013 10:57:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int main()
{
int i,cnt,n,j;
char prim[2000005];
f>>n;
cnt=0;
for(i=2; i<=n; i++)
prim[i]=1;
for(i=2; i<=n; i++)
if(prim[i]==1)
{
cnt++;
for(j=i+i; j<=n; j+=i)
prim[j]=0;
}
g<<cnt;
return 0;
}