Cod sursa(job #1273004)
Utilizator | Data | 22 noiembrie 2014 14:44:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int i,n,j,ci,v[100],cnt=0;
in>>n;
for(i=2;i<=n;i++) v[i]=1;
for(i=2;i<=sqrt(n);i++)
if(v[i]==1)
for(j=i;j<=n/i;j++) v[i*j]=0;
for(i=2;i<=n;i++) if(v[i]==1) cnt++;
out<<cnt;
return 0;
}