Cod sursa(job #743347)
Utilizator | Data | 3 mai 2012 22:53:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
# include<fstream>
using namespace std;
int main()
{
int n,i,nr=0,j;
char ciur[200001];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{if(ciur[i]==0)
{nr++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=1;}}
g<<nr;
return 0;}