Cod sursa(job #1514699)
Utilizator | Data | 31 octombrie 2015 14:23:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, i, j, k=0;
f>>n;
bool v[n+1];
for(i=2;i<=n;i++)
v[i]=true;
for(i=2;i<=n;i++)
{
if (v[i])
{
k++;
for(j=2*i;j<=n;j=j+i)
v[j]=false;
}
}
g<<k;
f.close();
g.close();
return 0;
}