Cod sursa(job #1331315)
Utilizator | Data | 31 ianuarie 2015 15:15:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j;
f>>n;
char prim[n+1];
int nr=0;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i*i<=n;i++)
if(prim[i]==1)
for(j=i*i;j<=n;j=j+i)
{
prim[j]=0;
}
for(i=2;i<=n;i++)
if(prim[i]==1) nr++;
g<<nr;
return 0;
}