Cod sursa(job #752778)
Utilizator | Data | 29 mai 2012 15:30:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{ int i,n,k=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
int v[n+1];
for(i=2;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
if(v[i])
{ k++;
for(int j=i+i;j<=n;j+=i)
v[j]=0;
}
g<<k;
g.flush();
return 0;
}