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