Cod sursa(job #301509)
Utilizator | Data | 8 aprilie 2009 11:40:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
#include<fstream>
using namespace std;
char p[2000010];
int contor=0,i,j,n;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{f>>n;
p[1]=0;
for(i=2; i<=n; i++)
p[i]=1;
for(i=2; i<=n; i++)
if(p[i])
for(j=i+i; j<=n; j=j+i)
p[j]=0;
for(i=1; i<=n; i++)
if(p[i])
contor++;
g<<contor;
return 0;
}