Cod sursa(job #1462150)
Utilizator | Data | 17 iulie 2015 11:21:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
bool c[200001];
int n,i,j,nr;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for(i=2;i<=n;i++)
{
if(c[i]==0)
nr++;
for(j=i+i;j<=n;j=j+i)
c[j]=1;
}
g<<nr;
return 0;
}