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