Cod sursa(job #489033)
Utilizator | Data | 30 septembrie 2010 19:19:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
long int n,m,i,j,p;
in>>n;
m=2;
for(i=5;i<=n;i=i+2)
{p=0;
for(j=3;j<=i/2;j=j+2)
if(i%j==0)
p=1;
if(p==0)
m=m+1;}
out<<m;
}