Cod sursa(job #1100345)
Utilizator | Data | 6 februarie 2014 20:17:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,j,nr=0;
in>>n;
int v[n];
for(i=2;i<n;i++)
v[i]=1;
for(i=2;i*i<=n;i++)
if(v[i])
for(j=2;j*i<n;j++)
v[i*j]=0;
for(i=2;i<=n;i++)
if(v[i])
nr=nr+1;
out<<nr;
return 0;
}